Base | Representation |
---|---|
bin | 1001000110001000101001… |
… | …01100110110111001110100 |
3 | 2121211011200110122010200200 |
4 | 10203010110230312321310 |
5 | 10110203104030013022 |
6 | 110312444015240500 |
7 | 4133045311526064 |
oct | 443042454667164 |
9 | 77734613563620 |
10 | 20002010001012 |
11 | 64118942155a6 |
12 | 22b0634819130 |
13 | b21248850250 |
14 | 4d216119b3a4 |
15 | 24a471571bac |
hex | 123114b36e74 |
20002010001012 has 72 divisors (see below), whose sum is σ = 54451373481960. Its totient is φ = 6154299889920.
The previous prime is 20002010001011. The next prime is 20002010001023. The reversal of 20002010001012 is 21010001020002.
It can be written as a sum of positive squares in 4 ways, for example, as 1838508199056 + 18163501801956 = 1355916^2 + 4261866^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20002010000985 and 20002010001003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002010001011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17544462 + ... + 18649722.
Almost surely, 220002010001012 is an apocalyptic number.
It is an amenable number.
20002010001012 is an abundant number, since it is smaller than the sum of its proper divisors (34449363480948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20002010001012 is a wasteful number, since it uses less digits than its factorization.
20002010001012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1143953 (or 1143948 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20002010001012 its reverse (21010001020002), we get a palindrome (41012011021014).
The spelling of 20002010001012 in words is "twenty trillion, two billion, ten million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •