Base | Representation |
---|---|
bin | 100100110100101010111… |
… | …0010001111111010000000 |
3 | 122220211002120100210222020 |
4 | 1021221111302033322000 |
5 | 1130404221120213100 |
6 | 14432541132241440 |
7 | 1031432041154166 |
oct | 111512562177200 |
9 | 18824076323866 |
10 | 5060910710400 |
11 | 1681358181846 |
12 | 698a08910280 |
13 | 2a931b3c7b3c |
14 | 136d41183236 |
15 | 8b9a4db95a0 |
hex | 49a55c8fe80 |
5060910710400 has 768 divisors, whose sum is σ = 17721684489600. Its totient is φ = 1265880268800.
The previous prime is 5060910710327. The next prime is 5060910710407. The reversal of 5060910710400 is 40170190605.
It is a super-2 number, since 2×50609107104002 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5060910710407) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 15017539032 + ... + 15017539368.
Almost surely, 25060910710400 is an apocalyptic number.
5060910710400 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 5060910710400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8860842244800).
5060910710400 is an abundant number, since it is smaller than the sum of its proper divisors (12660773779200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5060910710400 is a wasteful number, since it uses less digits than its factorization.
5060910710400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 957 (or 940 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 33.
The spelling of 5060910710400 in words is "five trillion, sixty billion, nine hundred ten million, seven hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •