Base | Representation |
---|---|
bin | 1000001111001001… |
… | …0100001001001101 |
3 | 12201002101200200021 |
4 | 2003302110021031 |
5 | 14012004130010 |
6 | 1003221302141 |
7 | 105535142506 |
oct | 20362241115 |
9 | 5632350607 |
10 | 2211005005 |
11 | a35066870 |
12 | 518564951 |
13 | 2930b57b1 |
14 | 16d903bad |
15 | ce1928da |
hex | 83c9424d |
2211005005 has 8 divisors (see below), whose sum is σ = 2894406624. Its totient is φ = 1608003600.
The previous prime is 2211004993. The next prime is 2211005009. The reversal of 2211005005 is 5005001122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2211005005 - 225 = 2177450573 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2211005005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211005009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20099991 + ... + 20100100.
It is an arithmetic number, because the mean of its divisors is an integer number (361800828).
Almost surely, 22211005005 is an apocalyptic number.
It is an amenable number.
2211005005 is a deficient number, since it is larger than the sum of its proper divisors (683401619).
2211005005 is a wasteful number, since it uses less digits than its factorization.
2211005005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40200107.
The product of its (nonzero) digits is 100, while the sum is 16.
The square root of 2211005005 is about 47021.3250025986. The cubic root of 2211005005 is about 1302.7564795180.
Adding to 2211005005 its reverse (5005001122), we get a palindrome (7216006127).
The spelling of 2211005005 in words is "two billion, two hundred eleven million, five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •