Base | Representation |
---|---|
bin | 11101000110110111000… |
… | …011110001011010110101 |
3 | 21002012221112112110212212 |
4 | 131012313003301122311 |
5 | 230232433114341041 |
6 | 4130520552223205 |
7 | 264340406034344 |
oct | 35066703613265 |
9 | 7065845473785 |
10 | 2000231012021 |
11 | 701325295610 |
12 | 2837a939ab05 |
13 | 11680c389188 |
14 | 6cb51425b5b |
15 | 3706d4108eb |
hex | 1d1b70f16b5 |
2000231012021 has 16 divisors (see below), whose sum is σ = 2212364067840. Its totient is φ = 1793202618480.
The previous prime is 2000231012009. The next prime is 2000231012047. The reversal of 2000231012021 is 1202101320002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2000231012021 - 26 = 2000231011957 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2000231011987 and 2000231012005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000231012081) 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, 672971 + ... + 2110296.
It is an arithmetic number, because the mean of its divisors is an integer number (138272754240).
Almost surely, 22000231012021 is an apocalyptic number.
It is an amenable number.
2000231012021 is a deficient number, since it is larger than the sum of its proper divisors (212133055819).
2000231012021 is a wasteful number, since it uses less digits than its factorization.
2000231012021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2784184.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 2000231012021 its reverse (1202101320002), we get a palindrome (3202332332023).
The spelling of 2000231012021 in words is "two trillion, two hundred thirty-one million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •