Base | Representation |
---|---|
bin | 1001100011001011111011… |
… | …00001011000001100101100 |
3 | 2202100121012010010101210010 |
4 | 10301211331201120030230 |
5 | 10223031402424341022 |
6 | 112355205325013220 |
7 | 4265133362241525 |
oct | 461457541301454 |
9 | 82317163111703 |
10 | 21000201012012 |
11 | 6767153aa7262 |
12 | 2431b909b4210 |
13 | b944060cc3a1 |
14 | 5285b526b84c |
15 | 2663e40a650c |
hex | 13197d85832c |
21000201012012 has 12 divisors (see below), whose sum is σ = 49000469028056. Its totient is φ = 7000067004000.
The previous prime is 21000201011971. The next prime is 21000201012013. The reversal of 21000201012012 is 21021010200012.
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: 1750016751001 = 21000201012012 / (2 + 1 + 0 + 0 + 0 + 2 + 0 + 1 + 0 + 1 + 2 + 0 + 1 + 2).
It is not an unprimeable number, because it can be changed into a prime (21000201012013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 875008375489 + ... + 875008375512.
Almost surely, 221000201012012 is an apocalyptic number.
It is an amenable number.
21000201012012 is an abundant number, since it is smaller than the sum of its proper divisors (28000268016044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000201012012 is a wasteful number, since it uses less digits than its factorization.
21000201012012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1750016751008 (or 1750016751006 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 21000201012012 its reverse (21021010200012), we get a palindrome (42021211212024).
The spelling of 21000201012012 in words is "twenty-one trillion, two hundred one million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •