Base | Representation |
---|---|
bin | 11101000111110010000… |
… | …110001100011000101001 |
3 | 21002022111120022121101121 |
4 | 131013302012030120221 |
5 | 230242000201040010 |
6 | 4131203134015241 |
7 | 264404064050611 |
oct | 35076206143051 |
9 | 7068446277347 |
10 | 2001221502505 |
11 | 701793403795 |
12 | 283a25047521 |
13 | 116939646b14 |
14 | 6cc06bb9a41 |
15 | 370ca3643da |
hex | 1d1f218c629 |
2001221502505 has 16 divisors (see below), whose sum is σ = 2434821434640. Its totient is φ = 1578748382208.
The previous prime is 2001221502499. The next prime is 2001221502529. The reversal of 2001221502505 is 5052051221002.
It can be written as a sum of positive squares in 8 ways, for example, as 115249386256 + 1885972116249 = 339484^2 + 1373307^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001221502505 - 25 = 2001221502473 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2001221502505.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1432501 + ... + 2460589.
It is an arithmetic number, because the mean of its divisors is an integer number (152176339665).
Almost surely, 22001221502505 is an apocalyptic number.
It is an amenable number.
2001221502505 is a deficient number, since it is larger than the sum of its proper divisors (433599932135).
2001221502505 is a wasteful number, since it uses less digits than its factorization.
2001221502505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1033500.
The product of its (nonzero) digits is 2000, while the sum is 25.
Adding to 2001221502505 its reverse (5052051221002), we get a palindrome (7053272723507).
The spelling of 2001221502505 in words is "two trillion, one billion, two hundred twenty-one million, five hundred two thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •