Base | Representation |
---|---|
bin | 11101000110111011010… |
… | …010100110111010100101 |
3 | 21002020010111010112211102 |
4 | 131012323102212322211 |
5 | 230233104303310041 |
6 | 4130532010045445 |
7 | 264342230355530 |
oct | 35067322467245 |
9 | 7066114115742 |
10 | 2000302010021 |
11 | 701361378447 |
12 | 283809119885 |
13 | 116820cb7023 |
14 | 6cb5aa27a17 |
15 | 3707478709b |
hex | 1d1bb4a6ea5 |
2000302010021 has 16 divisors (see below), whose sum is σ = 2484003471360. Its totient is φ = 1571908440240.
The previous prime is 2000302009943. The next prime is 2000302010051. The reversal of 2000302010021 is 1200102030002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2000302010021 - 230 = 1999228268197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000302009984 and 2000302010011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000302010051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 242574341 + ... + 242582586.
It is an arithmetic number, because the mean of its divisors is an integer number (155250216960).
Almost surely, 22000302010021 is an apocalyptic number.
It is an amenable number.
2000302010021 is a deficient number, since it is larger than the sum of its proper divisors (483701461339).
2000302010021 is a wasteful number, since it uses less digits than its factorization.
2000302010021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485156984.
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 2000302010021 its reverse (1200102030002), we get a palindrome (3200404040023).
The spelling of 2000302010021 in words is "two trillion, three hundred two million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •