Base | Representation |
---|---|
bin | 11101000111000001011… |
… | …00101001001010110101 |
3 | 10112121200210220212020011 |
4 | 32203200230221022311 |
5 | 112341403231241041 |
6 | 2043253032340221 |
7 | 132155641345315 |
oct | 16434054511265 |
9 | 3477623825204 |
10 | 1000202212021 |
11 | 356202089871 |
12 | 141a19844671 |
13 | 7341b14891c |
14 | 365a5243445 |
15 | 1b03e3aae81 |
hex | e8e0b292b5 |
1000202212021 has 16 divisors (see below), whose sum is σ = 1039675881600. Its totient is φ = 961064596800.
The previous prime is 1000202212019. The next prime is 1000202212027. The reversal of 1000202212021 is 1202122020001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1000202212021 - 21 = 1000202212019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1000202211992 and 1000202212010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000202212027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15314766 + ... + 15379936.
It is an arithmetic number, because the mean of its divisors is an integer number (64979742600).
Almost surely, 21000202212021 is an apocalyptic number.
It is an amenable number.
1000202212021 is a deficient number, since it is larger than the sum of its proper divisors (39473669579).
1000202212021 is a wasteful number, since it uses less digits than its factorization.
1000202212021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67740.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 1000202212021 its reverse (1202122020001), we get a palindrome (2202324232022).
The spelling of 1000202212021 in words is "one trillion, two hundred two million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •