Base | Representation |
---|---|
bin | 1001011011111011… |
… | …01011101000000010 |
3 | 111002001210010110220 |
4 | 10231331223220002 |
5 | 40333411031430 |
6 | 2154412203510 |
7 | 236354144226 |
oct | 45575535002 |
9 | 14061703426 |
10 | 5066111490 |
11 | 216a762600 |
12 | b94769596 |
13 | 62976850b |
14 | 360b90786 |
15 | 1e9b65110 |
hex | 12df6ba02 |
5066111490 has 48 divisors (see below), whose sum is σ = 13364495424. Its totient is φ = 1228147360.
The previous prime is 5066111473. The next prime is 5066111507. The reversal of 5066111490 is 941116605.
It is an interprime number because it is at equal distance from previous prime (5066111473) and next prime (5066111507).
It is a super-2 number, since 2×50661114902 = 51330971258220040200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 694182 + ... + 701441.
It is an arithmetic number, because the mean of its divisors is an integer number (278426988).
Almost surely, 25066111490 is an apocalyptic number.
5066111490 is an abundant number, since it is smaller than the sum of its proper divisors (8298383934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5066111490 is a wasteful number, since it uses less digits than its factorization.
5066111490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1395655 (or 1395644 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 33.
The square root of 5066111490 is about 71176.6217939570. The cubic root of 5066111490 is about 1717.4795753225.
The spelling of 5066111490 in words is "five billion, sixty-six million, one hundred eleven thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •