Base | Representation |
---|---|
bin | 1001000110101100011001… |
… | …00001101010010100110100 |
3 | 2121220000012212101022011211 |
4 | 10203112030201222110310 |
5 | 10111011404222413022 |
6 | 110325340140011204 |
7 | 4134325001532043 |
oct | 443261441522464 |
9 | 77800185338154 |
10 | 20021200201012 |
11 | 6419a4161a91a |
12 | 22b42ab530b04 |
13 | b22cb652348a |
14 | 4d3061ac655a |
15 | 24abe617be77 |
hex | 12358c86a534 |
20021200201012 has 24 divisors (see below), whose sum is σ = 36274295925000. Its totient is φ = 9657668407296.
The previous prime is 20021200200997. The next prime is 20021200201091. The reversal of 20021200201012 is 21010200212002.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1831350519076 + 18189849681936 = 1353274^2 + 4264956^2 .
It is a junction number, because it is equal to n+sod(n) for n = 20021200200983 and 20021200201001.
It is a congruent number.
It is an unprimeable number.
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, 68949013 + ... + 69238780.
It is an arithmetic number, because the mean of its divisors is an integer number (1511428996875).
Almost surely, 220021200201012 is an apocalyptic number.
It is an amenable number.
20021200201012 is a deficient number, since it is larger than the sum of its proper divisors (16253095723988).
20021200201012 is a wasteful number, since it uses less digits than its factorization.
20021200201012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138189075 (or 138189073 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20021200201012 its reverse (21010200212002), we get a palindrome (41031400413014).
The spelling of 20021200201012 in words is "twenty trillion, twenty-one billion, two hundred million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •