Base | Representation |
---|---|
bin | 1001000110101100000010… |
… | …01100000110100010000001 |
3 | 2121212222201121111002102221 |
4 | 10203112001030012202001 |
5 | 10111011012030000001 |
6 | 110325305223211041 |
7 | 4134320202046123 |
oct | 443260114064201 |
9 | 77788647432387 |
10 | 20021010000001 |
11 | 641995421aaaa |
12 | 22b42578a6a81 |
13 | b22c85cba3ba |
14 | 4d3044735213 |
15 | 24abd460b1a1 |
hex | 123581306881 |
20021010000001 has 4 divisors (see below), whose sum is σ = 20052244025604. Its totient is φ = 19989775974400.
The previous prime is 20021009999981. The next prime is 20021010000073. The reversal of 20021010000001 is 10000001012002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10234874241601 + 9786135758400 = 3199199^2 + 3128280^2 .
It is a cyclic number.
It is not a de Polignac number, because 20021010000001 - 211 = 20021009997953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20021010007001) 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, 15617011840 + ... + 15617013121.
It is an arithmetic number, because the mean of its divisors is an integer number (5013061006401).
Almost surely, 220021010000001 is an apocalyptic number.
It is an amenable number.
20021010000001 is a deficient number, since it is larger than the sum of its proper divisors (31234025603).
20021010000001 is an equidigital number, since it uses as much as digits as its factorization.
20021010000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31234025602.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 20021010000001 its reverse (10000001012002), we get a palindrome (30021011012003).
The spelling of 20021010000001 in words is "twenty trillion, twenty-one billion, ten million, one", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •