Base | Representation |
---|---|
bin | 10111001101110010000101… |
… | …010111111101011001000100 |
3 | 111101111212121212220000121020 |
4 | 113031302011113331121010 |
5 | 101340320301223223022 |
6 | 1001053034144551140 |
7 | 30335432463124221 |
oct | 2715620527753104 |
9 | 441455555800536 |
10 | 102102200211012 |
11 | 2a595333247171 |
12 | b5501103224b0 |
13 | 44c8271c93451 |
14 | 1b2dab6a16948 |
15 | bc0da4c4635c |
hex | 5cdc855fd644 |
102102200211012 has 96 divisors (see below), whose sum is σ = 242895953139840. Its totient is φ = 33375996656640.
The previous prime is 102102200210987. The next prime is 102102200211131. The reversal of 102102200211012 is 210112002201201.
It is a junction number, because it is equal to n+sod(n) for n = 102102200210982 and 102102200211000.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 71395863 + ... + 72811905.
It is an arithmetic number, because the mean of its divisors is an integer number (2530166178540).
Almost surely, 2102102200211012 is an apocalyptic number.
102102200211012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102102200211012 is an abundant number, since it is smaller than the sum of its proper divisors (140793752928828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102102200211012 is a wasteful number, since it uses less digits than its factorization.
102102200211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1416693 (or 1416691 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102102200211012 its reverse (210112002201201), we get a palindrome (312214202412213).
The spelling of 102102200211012 in words is "one hundred two trillion, one hundred two billion, two hundred million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •