Base | Representation |
---|---|
bin | 11101011010001101000… |
… | …111001110100011101100 |
3 | 21011012120010000122100220 |
4 | 131122031013032203230 |
5 | 231103003020024322 |
6 | 4144234025051340 |
7 | 266004213335010 |
oct | 35321507164354 |
9 | 7135503018326 |
10 | 2021002111212 |
11 | 70a114005897 |
12 | 287825626b50 |
13 | 11876c738106 |
14 | 6db61cb2540 |
15 | 37886be555c |
hex | 1d68d1ce8ec |
2021002111212 has 48 divisors (see below), whose sum is σ = 5389461826560. Its totient is φ = 577416010752.
The previous prime is 2021002111151. The next prime is 2021002111273. The reversal of 2021002111212 is 2121112001202.
It is an interprime number because it is at equal distance from previous prime (2021002111151) and next prime (2021002111273).
It is a super-2 number, since 2×20210021112122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2021002111191 and 2021002111200.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3788428 + ... + 4288844.
It is an arithmetic number, because the mean of its divisors is an integer number (112280454720).
Almost surely, 22021002111212 is an apocalyptic number.
It is an amenable number.
2021002111212 is an abundant number, since it is smaller than the sum of its proper divisors (3368459715348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2021002111212 is a wasteful number, since it uses less digits than its factorization.
2021002111212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 548510 (or 548508 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2021002111212 its reverse (2121112001202), we get a palindrome (4142114112414).
The spelling of 2021002111212 in words is "two trillion, twenty-one billion, two million, one hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •