Base | Representation |
---|---|
bin | 11101101101011100111… |
… | …100011001000111001001 |
3 | 21020011220102001021000212 |
4 | 131231130330121013021 |
5 | 231422314203112334 |
6 | 4201532452010505 |
7 | 300335312316560 |
oct | 35553474310711 |
9 | 7204812037025 |
10 | 2041668800969 |
11 | 7179598a2786 |
12 | 28b832900a35 |
13 | 11a6b428b515 |
14 | 70b62940bd7 |
15 | 38196253ece |
hex | 1db5cf191c9 |
2041668800969 has 8 divisors (see below), whose sum is σ = 2333425078080. Its totient is φ = 1749934850256.
The previous prime is 2041668800929. The next prime is 2041668800989. The reversal of 2041668800969 is 9690088661402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2041668800969 - 224 = 2041652023753 is a prime.
It is a super-2 number, since 2×20416688009692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2041668800929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5385179 + ... + 5751824.
It is an arithmetic number, because the mean of its divisors is an integer number (291678134760).
Almost surely, 22041668800969 is an apocalyptic number.
It is an amenable number.
2041668800969 is a deficient number, since it is larger than the sum of its proper divisors (291756277111).
2041668800969 is a wasteful number, since it uses less digits than its factorization.
2041668800969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11163199.
The product of its (nonzero) digits is 8957952, while the sum is 59.
The spelling of 2041668800969 in words is "two trillion, forty-one billion, six hundred sixty-eight million, eight hundred thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •