Base | Representation |
---|---|
bin | 11101000110101011110… |
… | …01011101001000011100 |
3 | 10112121020011222102011110 |
4 | 32203111321131020130 |
5 | 112341020340134322 |
6 | 2043223041022020 |
7 | 132151311300243 |
oct | 16432571351034 |
9 | 3477204872143 |
10 | 1000021021212 |
11 | 3561198834a4 |
12 | 141989024910 |
13 | 733bc748a25 |
14 | 3658915995a |
15 | 1b02d519c0c |
hex | e8d5e5d21c |
1000021021212 has 12 divisors (see below), whose sum is σ = 2333382382856. Its totient is φ = 333340340400.
The previous prime is 1000021021199. The next prime is 1000021021229. The reversal of 1000021021212 is 2121201200001.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 83335085101 = 1000021021212 / (1 + 0 + 0 + 0 + 0 + 2 + 1 + 0 + 2 + 1 + 2 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41667542539 + ... + 41667542562.
Almost surely, 21000021021212 is an apocalyptic number.
1000021021212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1000021021212 is an abundant number, since it is smaller than the sum of its proper divisors (1333361361644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000021021212 is a wasteful number, since it uses less digits than its factorization.
1000021021212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83335085108 (or 83335085106 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1000021021212 its reverse (2121201200001), we get a palindrome (3121222221213).
The spelling of 1000021021212 in words is "one trillion, twenty-one million, twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •