Base | Representation |
---|---|
bin | 10111001111001110000111… |
… | …011111100111100101111000 |
3 | 111101212022200210210111122220 |
4 | 113033032013133213211320 |
5 | 101343430142111133422 |
6 | 1001210300032244040 |
7 | 30345531356502645 |
oct | 2717160737474570 |
9 | 441768623714586 |
10 | 102201020021112 |
11 | 2a623233477111 |
12 | b5672aa9a0620 |
13 | 450469012656c |
14 | 1b347ad022dcc |
15 | bc373a559e5c |
hex | 5cf3877e7978 |
102201020021112 has 32 divisors (see below), whose sum is σ = 255675070432080. Its totient is φ = 34044003956480.
The previous prime is 102201020021083. The next prime is 102201020021129. The reversal of 102201020021112 is 211120020102201.
It is a junction number, because it is equal to n+sod(n) for n = 102201020021091 and 102201020021100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1437633543 + ... + 1437704630.
Almost surely, 2102201020021112 is an apocalyptic number.
102201020021112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102201020021112 is an abundant number, since it is smaller than the sum of its proper divisors (153474050410968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102201020021112 is a wasteful number, since it uses less digits than its factorization.
102201020021112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2875339663 (or 2875339659 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102201020021112 its reverse (211120020102201), we get a palindrome (313321040123313).
The spelling of 102201020021112 in words is "one hundred two trillion, two hundred one billion, twenty million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •