Base | Representation |
---|---|
bin | 10111001100100110011101… |
… | …100001111110011010101100 |
3 | 111101020010000222110100220120 |
4 | 113030212131201332122230 |
5 | 101333003002241024322 |
6 | 1000551444554244540 |
7 | 30326526341143641 |
oct | 2714463541763254 |
9 | 441203028410816 |
10 | 102021001111212 |
11 | 2a563955499717 |
12 | b53842aa26750 |
13 | 44c07015c0b31 |
14 | 1b29bb2903dc8 |
15 | bbdc01368a5c |
hex | 5cc99d87e6ac |
102021001111212 has 24 divisors (see below), whose sum is σ = 238051427077296. Its totient is φ = 34006654015488.
The previous prime is 102021001111121. The next prime is 102021001111229. The reversal of 102021001111212 is 212111100120201.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 102021001111191 and 102021001111200.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42065653 + ... + 44424780.
It is an arithmetic number, because the mean of its divisors is an integer number (9918809461554).
Almost surely, 2102021001111212 is an apocalyptic number.
102021001111212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102021001111212 is an abundant number, since it is smaller than the sum of its proper divisors (136030425966084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102021001111212 is a wasteful number, since it uses less digits than its factorization.
102021001111212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 86588737 (or 86588735 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102021001111212 its reverse (212111100120201), we get a palindrome (314132101231413).
The spelling of 102021001111212 in words is "one hundred two trillion, twenty-one billion, one million, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •