Base | Representation |
---|---|
bin | 111100110011110… |
… | …0111111010000011 |
3 | 12021012102121001022 |
4 | 1321213213322003 |
5 | 13134322231321 |
6 | 534245300055 |
7 | 101364241061 |
oct | 17147477203 |
9 | 5235377038 |
10 | 2040430211 |
11 | 957851466 |
12 | 48b40462b |
13 | 266961971 |
14 | 154dc1031 |
15 | be1ebdab |
hex | 799e7e83 |
2040430211 has 8 divisors (see below), whose sum is σ = 2151096864. Its totient is φ = 1931592960.
The previous prime is 2040430177. The next prime is 2040430213. The reversal of 2040430211 is 1120340402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2040430211 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 2040430211.
It is not an unprimeable number, because it can be changed into a prime (2040430213) 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 7 ways as a sum of consecutive naturals, for example, 455060 + ... + 459521.
It is an arithmetic number, because the mean of its divisors is an integer number (268887108).
Almost surely, 22040430211 is an apocalyptic number.
2040430211 is a deficient number, since it is larger than the sum of its proper divisors (110666653).
2040430211 is an equidigital number, since it uses as much as digits as its factorization.
2040430211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 914701.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 2040430211 is about 45171.1214273013. The cubic root of 2040430211 is about 1268.3542886692.
Adding to 2040430211 its reverse (1120340402), we get a palindrome (3160770613).
The spelling of 2040430211 in words is "two billion, forty million, four hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •