Base | Representation |
---|---|
bin | 100101000111110011110… |
… | …0101110000111011101000 |
3 | 200001202011221222012102020 |
4 | 1022033213211300323220 |
5 | 1132042404433221000 |
6 | 14503455355304440 |
7 | 1034415414125214 |
oct | 112174745607350 |
9 | 20052157865366 |
10 | 5102011617000 |
11 | 1697829604251 |
12 | 6a497944b120 |
13 | 2b016b58790c |
14 | 138d1da47944 |
15 | 8caad365ba0 |
hex | 4a3e7970ee8 |
5102011617000 has 64 divisors (see below), whose sum is σ = 15918276254400. Its totient is φ = 1360536430400.
The previous prime is 5102011616963. The next prime is 5102011617023. The reversal of 5102011617000 is 7161102015.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 850332270 + ... + 850338269.
It is an arithmetic number, because the mean of its divisors is an integer number (248723066475).
Almost surely, 25102011617000 is an apocalyptic number.
5102011617000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5102011617000 is an abundant number, since it is smaller than the sum of its proper divisors (10816264637400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5102011617000 is a wasteful number, since it uses less digits than its factorization.
5102011617000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1700670563 (or 1700670549 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 24.
Adding to 5102011617000 its reverse (7161102015), we get a palindrome (5109172719015).
The spelling of 5102011617000 in words is "five trillion, one hundred two billion, eleven million, six hundred seventeen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •