Base | Representation |
---|---|
bin | 1001001001100110101011… |
… | …00101100100011011010001 |
3 | 2122020120100201212011011211 |
4 | 10210303111211210123101 |
5 | 10114131214303210001 |
6 | 110443320101340121 |
7 | 4144465226555215 |
oct | 444632545443321 |
9 | 78216321764154 |
10 | 20121210210001 |
11 | 64583a267190a |
12 | 230b760707641 |
13 | b2c5641288a4 |
14 | 4d7c2c1d0945 |
15 | 24d5eb1e2351 |
hex | 124cd59646d1 |
20121210210001 has 8 divisors (see below), whose sum is σ = 20310989137920. Its totient is φ = 19931921035488.
The previous prime is 20121210209999. The next prime is 20121210210083. The reversal of 20121210210001 is 10001201212102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20121210210001 - 21 = 20121210209999 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20121210216001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 122355796 + ... + 122520133.
It is an arithmetic number, because the mean of its divisors is an integer number (2538873642240).
Almost surely, 220121210210001 is an apocalyptic number.
It is an amenable number.
20121210210001 is a deficient number, since it is larger than the sum of its proper divisors (189778927919).
20121210210001 is a wasteful number, since it uses less digits than its factorization.
20121210210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244876703.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20121210210001 its reverse (10001201212102), we get a palindrome (30122411422103).
It can be divided in two parts, 201212102 and 10001, that multiplied together give a palindrome (2012322232102).
The spelling of 20121210210001 in words is "twenty trillion, one hundred twenty-one billion, two hundred ten million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •