Base | Representation |
---|---|
bin | 11101001000101110010… |
… | …111000001010100101001 |
3 | 21002102010000202222011020 |
4 | 131020232113001110221 |
5 | 230301033012442401 |
6 | 4131451332123053 |
7 | 264441121560210 |
oct | 35105627012451 |
9 | 7072100688136 |
10 | 2002232546601 |
11 | 702162090121 |
12 | 284067766489 |
13 | 116a6ac4cb71 |
14 | 6cca11a0077 |
15 | 37138ec7d36 |
hex | 1d22e5c1529 |
2002232546601 has 32 divisors (see below), whose sum is σ = 3125571391488. Its totient is φ = 1116178911360.
The previous prime is 2002232546599. The next prime is 2002232546617. The reversal of 2002232546601 is 1066452322002.
It is a happy number.
It is not a de Polignac number, because 2002232546601 - 21 = 2002232546599 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2002232546201) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 30949050 + ... + 31013676.
It is an arithmetic number, because the mean of its divisors is an integer number (97674105984).
Almost surely, 22002232546601 is an apocalyptic number.
2002232546601 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2002232546601 is a deficient number, since it is larger than the sum of its proper divisors (1123338844887).
2002232546601 is a wasteful number, since it uses less digits than its factorization.
2002232546601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100661.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 2002232546601 its reverse (1066452322002), we get a palindrome (3068684868603).
The spelling of 2002232546601 in words is "two trillion, two billion, two hundred thirty-two million, five hundred forty-six thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •