Base | Representation |
---|---|
bin | 1001100011001011111010… |
… | …11101100001100111011100 |
3 | 2202100121012001020002022201 |
4 | 10301211331131201213130 |
5 | 10223031402200031022 |
6 | 112355205251221244 |
7 | 4265133350534110 |
oct | 461457535414734 |
9 | 82317161202281 |
10 | 21000200002012 |
11 | 6767153477450 |
12 | 2431b905a7824 |
13 | b94405b3775a |
14 | 5285b5087740 |
15 | 2663e3e57127 |
hex | 13197d7619dc |
21000200002012 has 48 divisors (see below), whose sum is σ = 45924435148032. Its totient is φ = 8163000218880.
The previous prime is 21000200002003. The next prime is 21000200002013. The reversal of 21000200002012 is 21020000200012.
It is a self number, because there is not a number n which added to its sum of digits gives 21000200002012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000200002013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 78599278 + ... + 78866005.
It is an arithmetic number, because the mean of its divisors is an integer number (956759065584).
Almost surely, 221000200002012 is an apocalyptic number.
21000200002012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21000200002012 is an abundant number, since it is smaller than the sum of its proper divisors (24924235146020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000200002012 is a wasteful number, since it uses less digits than its factorization.
21000200002012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157465738 (or 157465736 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 21000200002012 its reverse (21020000200012), we get a palindrome (42020200202024).
The spelling of 21000200002012 in words is "twenty-one trillion, two hundred million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •