Base | Representation |
---|---|
bin | 100110101110000001010… |
… | …1101101001010110000000 |
3 | 200211201202011220100222222 |
4 | 1031130002231221112000 |
5 | 1144141423030000000 |
6 | 15152400135350212 |
7 | 1056315656445665 |
oct | 115340255512600 |
9 | 20751664810888 |
10 | 5321510000000 |
11 | 1771926733167 |
12 | 71b416b22368 |
13 | 2c7a7c38160c |
14 | 1457c3557a6c |
15 | 936584bda85 |
hex | 4d702b69580 |
5321510000000 has 512 divisors, whose sum is σ = 14652103115520. Its totient is φ = 1914880000000.
The previous prime is 5321509999997. The next prime is 5321510000047. The reversal of 5321510000000 is 151235.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3909999320 + ... + 3910000680.
Almost surely, 25321510000000 is an apocalyptic number.
5321510000000 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 5321510000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7326051557760).
5321510000000 is an abundant number, since it is smaller than the sum of its proper divisors (9330593115520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5321510000000 is an frugal number, since it uses more digits than its factorization.
5321510000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1450 (or 1408 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 17.
Adding to 5321510000000 its reverse (151235), we get a palindrome (5321510151235).
The spelling of 5321510000000 in words is "five trillion, three hundred twenty-one billion, five hundred ten million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •