Base | Representation |
---|---|
bin | 11100001011000101… |
… | …00001001000110000 |
3 | 1110001002221212201221 |
4 | 32011202201020300 |
5 | 221434040221430 |
6 | 10540512034424 |
7 | 1043551046362 |
oct | 160542411060 |
9 | 43032855657 |
10 | 15125320240 |
11 | 6461937a68 |
12 | 2b21532a14 |
13 | 15707b6744 |
14 | a36b26d32 |
15 | 5d7d1b57a |
hex | 3858a1230 |
15125320240 has 160 divisors (see below), whose sum is σ = 38067563520. Its totient is φ = 5568000000.
The previous prime is 15125320201. The next prime is 15125320241. The reversal of 15125320240 is 4202352151.
It is not an unprimeable number, because it can be changed into a prime (15125320241) 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, 20139865 + ... + 20140615.
It is an arithmetic number, because the mean of its divisors is an integer number (237922272).
Almost surely, 215125320240 is an apocalyptic number.
15125320240 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 15125320240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19033781760).
15125320240 is an abundant number, since it is smaller than the sum of its proper divisors (22942243280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15125320240 is a wasteful number, since it uses less digits than its factorization.
15125320240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1091 (or 1085 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 15125320240 its reverse (4202352151), we get a palindrome (19327672391).
The spelling of 15125320240 in words is "fifteen billion, one hundred twenty-five million, three hundred twenty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •