Base | Representation |
---|---|
bin | 11011000100010000… |
… | …10100011101010000 |
3 | 1101111201002222120110 |
4 | 31202020110131100 |
5 | 214230000000000 |
6 | 10401531041320 |
7 | 1023045405231 |
oct | 154210243520 |
9 | 41451088513 |
10 | 14531250000 |
11 | 618756a223 |
12 | 29965a0240 |
13 | 14a76b5ba7 |
14 | 9bbc85088 |
15 | 5a0ac0850 |
hex | 362214750 |
14531250000 has 220 divisors, whose sum is σ = 48437499008. Its totient is φ = 3750000000.
The previous prime is 14531249977. The next prime is 14531250011. The reversal of 14531250000 is 5213541.
It is a super-2 number, since 2×145312500002 (a number of 21 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 (13) of ones.
It is a polite number, since it can be written in 43 ways as a sum of consecutive naturals, for example, 468749985 + ... + 468750015.
Almost surely, 214531250000 is an apocalyptic number.
14531250000 is a gapful number since it is divisible by the number (10) 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 14531250000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24218749504).
14531250000 is an abundant number, since it is smaller than the sum of its proper divisors (33906249008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14531250000 is an frugal number, since it uses more digits than its factorization.
14531250000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92 (or 41 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
Adding to 14531250000 its reverse (5213541), we get a palindrome (14536463541).
The spelling of 14531250000 in words is "fourteen billion, five hundred thirty-one million, two hundred fifty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •