Base | Representation |
---|---|
bin | 100100110110111000001… |
… | …1101000011011101000100 |
3 | 122221021100002000111102020 |
4 | 1021231300131003131010 |
5 | 1130443424143402000 |
6 | 14435043502243140 |
7 | 1031660414646660 |
oct | 111556035033504 |
9 | 18837302014366 |
10 | 5065653106500 |
11 | 1683371132168 |
12 | 699910b864b0 |
13 | 2a98c5a80c8c |
14 | 137270d498a0 |
15 | 8bb813d8ba0 |
hex | 49b70743744 |
5065653106500 has 768 divisors, whose sum is σ = 18249020375040. Its totient is φ = 1065548390400.
The previous prime is 5065653106439. The next prime is 5065653106571. The reversal of 5065653106500 is 56013565605.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 3472002771 + ... + 3472004229.
It is an arithmetic number, because the mean of its divisors is an integer number (23761745280).
Almost surely, 25065653106500 is an apocalyptic number.
5065653106500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5065653106500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9124510187520).
5065653106500 is an abundant number, since it is smaller than the sum of its proper divisors (13183367268540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5065653106500 is a wasteful number, since it uses less digits than its factorization.
5065653106500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1925 (or 1913 counting only the distinct ones).
The product of its (nonzero) digits is 405000, while the sum is 42.
The spelling of 5065653106500 in words is "five trillion, sixty-five billion, six hundred fifty-three million, one hundred six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •