Base | Representation |
---|---|
bin | 100100110111000010101… |
… | …0111110111100000111001 |
3 | 122221022020112102012122110 |
4 | 1021232011113313200321 |
5 | 1131000134020142114 |
6 | 14435142400442533 |
7 | 1032002206041354 |
oct | 111560527674071 |
9 | 18838215365573 |
10 | 5066004068409 |
11 | 1683531254029 |
12 | 6999aa619449 |
13 | 2a99506b2c4b |
14 | 1372a57c729b |
15 | 8bba2112759 |
hex | 49b855f7839 |
5066004068409 has 8 divisors (see below), whose sum is σ = 6797695480960. Its totient is φ = 3355824350736.
The previous prime is 5066004068393. The next prime is 5066004068441. The reversal of 5066004068409 is 9048604006605.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5066004068409 - 24 = 5066004068393 is a prime.
It is a super-2 number, since 2×50660040684092 (a number of 26 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 (5066004068459) 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, 5377923169 + ... + 5377924110.
It is an arithmetic number, because the mean of its divisors is an integer number (849711935120).
Almost surely, 25066004068409 is an apocalyptic number.
It is an amenable number.
5066004068409 is a deficient number, since it is larger than the sum of its proper divisors (1731691412551).
5066004068409 is a wasteful number, since it uses less digits than its factorization.
5066004068409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10755847439.
The product of its (nonzero) digits is 1244160, while the sum is 48.
The spelling of 5066004068409 in words is "five trillion, sixty-six billion, four million, sixty-eight thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •