Base | Representation |
---|---|
bin | 11101001000101001100… |
… | …110010010000110011101 |
3 | 21002101220110110101021021 |
4 | 131020221212102012131 |
5 | 230300402040131110 |
6 | 4131435400004141 |
7 | 264436131552601 |
oct | 35105146220635 |
9 | 7071813411237 |
10 | 2002152661405 |
11 | 702120a881a6 |
12 | 284044a60651 |
13 | 116a5752cb10 |
14 | 6cc94727501 |
15 | 37131e982da |
hex | 1d22999219d |
2002152661405 has 64 divisors (see below), whose sum is σ = 2841151723200. Its totient is φ = 1340198092800.
The previous prime is 2002152661403. The next prime is 2002152661409. The reversal of 2002152661405 is 5041662512002.
It can be written as a sum of positive squares in 32 ways, for example, as 1180234540996 + 821918120409 = 1086386^2 + 906597^2 .
It is not a de Polignac number, because 2002152661405 - 21 = 2002152661403 is a prime.
It is a super-2 number, since 2×20021526614052 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002152661403) 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 63 ways as a sum of consecutive naturals, for example, 12772141 + ... + 12927949.
It is an arithmetic number, because the mean of its divisors is an integer number (44392995675).
Almost surely, 22002152661405 is an apocalyptic number.
It is an amenable number.
2002152661405 is a deficient number, since it is larger than the sum of its proper divisors (838999061795).
2002152661405 is a wasteful number, since it uses less digits than its factorization.
2002152661405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156274.
The product of its (nonzero) digits is 28800, while the sum is 34.
The spelling of 2002152661405 in words is "two trillion, two billion, one hundred fifty-two million, six hundred sixty-one thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •