Base | Representation |
---|---|
bin | 100100110110100101010… |
… | …0000100110001101001110 |
3 | 122221012200201010120221100 |
4 | 1021231022200212031032 |
5 | 1130441123211013240 |
6 | 14434500401443530 |
7 | 1031635554621321 |
oct | 111551240461516 |
9 | 18835621116840 |
10 | 5065016501070 |
11 | 1683074852079 |
12 | 6997739405a6 |
13 | 2a9823c09986 |
14 | 1372105947b8 |
15 | 8bb45589e30 |
hex | 49b4a82634e |
5065016501070 has 96 divisors (see below), whose sum is σ = 13367071954080. Its totient is φ = 1330364851200.
The previous prime is 5065016501059. The next prime is 5065016501087. The reversal of 5065016501070 is 701056105605.
It is a super-2 number, since 2×50650165010702 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 61277770 + ... + 61360370.
It is an arithmetic number, because the mean of its divisors is an integer number (139240332855).
Almost surely, 25065016501070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5065016501070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6683535977040).
5065016501070 is an abundant number, since it is smaller than the sum of its proper divisors (8302055453010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5065016501070 is a wasteful number, since it uses less digits than its factorization.
5065016501070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92850 (or 92847 counting only the distinct ones).
The product of its (nonzero) digits is 31500, while the sum is 36.
The spelling of 5065016501070 in words is "five trillion, sixty-five billion, sixteen million, five hundred one thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •