Base | Representation |
---|---|
bin | 100101001100000001011… |
… | …1110110101111101001100 |
3 | 200002121112122012002220000 |
4 | 1022120002332311331030 |
5 | 1132214423121014404 |
6 | 14511553345324300 |
7 | 1035155600424411 |
oct | 112300276657514 |
9 | 20077478162800 |
10 | 5111061110604 |
11 | 16a065282a789 |
12 | 6a6684036690 |
13 | 2b0c81376967 |
14 | 13953b864108 |
15 | 8ce3ca6c339 |
hex | 4a602fb5f4c |
5111061110604 has 30 divisors (see below), whose sum is σ = 13361323336284. Its totient is φ = 1703687036760.
The previous prime is 5111061110591. The next prime is 5111061110611. The reversal of 5111061110604 is 4060111601115.
5111061110604 is a `hidden beast` number, since 51 + 1 + 1 + 0 + 6 + 1 + 1 + 1 + 0 + 604 = 666.
It is a super-2 number, since 2×51110611106042 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 7887439662 + ... + 7887440309.
Almost surely, 25111061110604 is an apocalyptic number.
5111061110604 is a gapful number since it is divisible by the number (54) formed by its first and last digit.
It is an amenable number.
5111061110604 is an abundant number, since it is smaller than the sum of its proper divisors (8250262225680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5111061110604 is a wasteful number, since it uses less digits than its factorization.
5111061110604 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15774879987 (or 15774879976 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 27.
Adding to 5111061110604 its reverse (4060111601115), we get a palindrome (9171172711719).
The spelling of 5111061110604 in words is "five trillion, one hundred eleven billion, sixty-one million, one hundred ten thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •