Base | Representation |
---|---|
bin | 11101001100010001110… |
… | …111001100001111100001 |
3 | 21002202222000212121122002 |
4 | 131030101313030033201 |
5 | 230331342122023334 |
6 | 4133322200453345 |
7 | 264634526424005 |
oct | 35142167141741 |
9 | 7082860777562 |
10 | 2006049407969 |
11 | 703840658602 |
12 | 284951a7a255 |
13 | 11722893bc09 |
14 | 6d144080705 |
15 | 372ae124b7e |
hex | 1d311dcc3e1 |
2006049407969 has 2 divisors, whose sum is σ = 2006049407970. Its totient is φ = 2006049407968.
The previous prime is 2006049407951. The next prime is 2006049407987. The reversal of 2006049407969 is 9697049406002.
It is a balanced prime because it is at equal distance from previous prime (2006049407951) and next prime (2006049407987).
It can be written as a sum of positive squares in only one way, i.e., 1446114477025 + 559934930944 = 1202545^2 + 748288^2 .
It is a cyclic number.
It is not a de Polignac number, because 2006049407969 - 236 = 1937329931233 is a prime.
It is a super-2 number, since 2×20060494079692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2006049407069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1003024703984 + 1003024703985.
It is an arithmetic number, because the mean of its divisors is an integer number (1003024703985).
Almost surely, 22006049407969 is an apocalyptic number.
It is an amenable number.
2006049407969 is a deficient number, since it is larger than the sum of its proper divisors (1).
2006049407969 is an equidigital number, since it uses as much as digits as its factorization.
2006049407969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5878656, while the sum is 56.
The spelling of 2006049407969 in words is "two trillion, six billion, forty-nine million, four hundred seven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •