Base | Representation |
---|---|
bin | 11101101110001000100… |
… | …00110110110001001001 |
3 | 10121121220011222010011210 |
4 | 32313010100312301021 |
5 | 113212404200031441 |
6 | 2101044404043333 |
7 | 133531200540255 |
oct | 16670420666111 |
9 | 3547804863153 |
10 | 1021200002121 |
11 | 3640a7862302 |
12 | 145ab9993549 |
13 | 753b64688b0 |
14 | 375d7c5d265 |
15 | 1b86ca1d616 |
hex | edc4436c49 |
1021200002121 has 8 divisors (see below), whose sum is σ = 1466338464640. Its totient is φ = 628430770512.
The previous prime is 1021200002117. The next prime is 1021200002201. The reversal of 1021200002121 is 1212000021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1021200002121 - 22 = 1021200002117 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1021200002097 and 1021200002106.
It is not an unprimeable number, because it can be changed into a prime (1021200001121) 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 7 ways as a sum of consecutive naturals, for example, 13092307681 + ... + 13092307758.
It is an arithmetic number, because the mean of its divisors is an integer number (183292308080).
Almost surely, 21021200002121 is an apocalyptic number.
It is an amenable number.
1021200002121 is a deficient number, since it is larger than the sum of its proper divisors (445138462519).
1021200002121 is a wasteful number, since it uses less digits than its factorization.
1021200002121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26184615455.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1021200002121 its reverse (1212000021201), we get a palindrome (2233200023322).
The spelling of 1021200002121 in words is "one trillion, twenty-one billion, two hundred million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •