Base | Representation |
---|---|
bin | 10111000000110110000011… |
… | …010000000101010010011100 |
3 | 111021100212201101221210021110 |
4 | 113000312003100011102130 |
5 | 101231233420212032000 |
6 | 555132354214102020 |
7 | 30214256062111620 |
oct | 2700660320052234 |
9 | 437325641853243 |
10 | 101213106361500 |
11 | 2a282267a14691 |
12 | b42794064a910 |
13 | 446247cb62833 |
14 | 1adca51c71180 |
15 | ba7bb9e1b850 |
hex | 5c0d8340549c |
101213106361500 has 192 divisors, whose sum is σ = 337677225080832. Its totient is φ = 23076731520000.
The previous prime is 101213106361429. The next prime is 101213106361529. The reversal of 101213106361500 is 5163601312101.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 7808632 + ... + 16229631.
It is an arithmetic number, because the mean of its divisors is an integer number (1758735547296).
Almost surely, 2101213106361500 is an apocalyptic number.
101213106361500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101213106361500 is an abundant number, since it is smaller than the sum of its proper divisors (236464118719332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101213106361500 is a wasteful number, since it uses less digits than its factorization.
101213106361500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24038693 (or 24038681 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 30.
Adding to 101213106361500 its reverse (5163601312101), we get a palindrome (106376707673601).
The spelling of 101213106361500 in words is "one hundred one trillion, two hundred thirteen billion, one hundred six million, three hundred sixty-one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •