Base | Representation |
---|---|
bin | 100101000111010111011… |
… | …1001110000001111101000 |
3 | 200001122201200101021122120 |
4 | 1022032232321300033220 |
5 | 1132033433000241002 |
6 | 14503221142551240 |
7 | 1034353015212000 |
oct | 112165671601750 |
9 | 20048650337576 |
10 | 5101060555752 |
11 | 1697390776917 |
12 | 6a4752a38520 |
13 | 2b0049523a95 |
14 | 138c6d5d9000 |
15 | 8ca54aeecbc |
hex | 4a3aee703e8 |
5101060555752 has 128 divisors (see below), whose sum is σ = 14913331200000. Its totient is φ = 1453385293248.
The previous prime is 5101060555583. The next prime is 5101060555753. The reversal of 5101060555752 is 2575550601015.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (5101060555753) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2092249 + ... + 3818327.
It is an arithmetic number, because the mean of its divisors is an integer number (116510400000).
Almost surely, 25101060555752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5101060555752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7456665600000).
5101060555752 is an abundant number, since it is smaller than the sum of its proper divisors (9812270644248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5101060555752 is a wasteful number, since it uses less digits than its factorization.
5101060555752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1726468 (or 1726450 counting only the distinct ones).
The product of its (nonzero) digits is 262500, while the sum is 42.
The spelling of 5101060555752 in words is "five trillion, one hundred one billion, sixty million, five hundred fifty-five thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •