Base | Representation |
---|---|
bin | 100101001000101101100… |
… | …1100010110010000000000 |
3 | 200001221012010110201020120 |
4 | 1022101123030112100000 |
5 | 1132110342441024133 |
6 | 14504420041340240 |
7 | 1034514444425160 |
oct | 112213314262000 |
9 | 20057163421216 |
10 | 5103951111168 |
11 | 1698634384998 |
12 | 6a521aa97680 |
13 | 2b03ba3389c0 |
14 | 1390654725a0 |
15 | 8cb73775ab3 |
hex | 4a45b316400 |
5103951111168 has 1408 divisors, whose sum is σ = 18302970470400. Its totient is φ = 1226626301952.
The previous prime is 5103951111163. The next prime is 5103951111197. The reversal of 5103951111168 is 8611111593015.
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 (5103951111163) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 30562581421 + ... + 30562581587.
It is an arithmetic number, because the mean of its divisors is an integer number (12999268800).
Almost surely, 25103951111168 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 5103951111168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9151485235200).
5103951111168 is an abundant number, since it is smaller than the sum of its proper divisors (13199019359232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5103951111168 is a wasteful number, since it uses less digits than its factorization.
5103951111168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395 (or 377 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 42.
The spelling of 5103951111168 in words is "five trillion, one hundred three billion, nine hundred fifty-one million, one hundred eleven thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •