Base | Representation |
---|---|
bin | 11100111011010100… |
… | …11001111010101000 |
3 | 1111002022111211020201 |
4 | 32131222121322220 |
5 | 223301142303000 |
6 | 11045010401544 |
7 | 1056564112315 |
oct | 163552317250 |
9 | 44068454221 |
10 | 15530041000 |
11 | 664a337731 |
12 | 3014b902b4 |
13 | 16065bb996 |
14 | a74799d0c |
15 | 60d61396a |
hex | 39da99ea8 |
15530041000 has 64 divisors (see below), whose sum is σ = 36369103680. Its totient is φ = 6207092800.
The previous prime is 15530040971. The next prime is 15530041031. The reversal of 15530041000 is 14003551.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1421559 + ... + 1432441.
It is an arithmetic number, because the mean of its divisors is an integer number (568267245).
Almost surely, 215530041000 is an apocalyptic number.
15530041000 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 15530041000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18184551840).
15530041000 is an abundant number, since it is smaller than the sum of its proper divisors (20839062680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15530041000 is a wasteful number, since it uses less digits than its factorization.
15530041000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12331 (or 12317 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 19.
Adding to 15530041000 its reverse (14003551), we get a palindrome (15544044551).
The spelling of 15530041000 in words is "fifteen billion, five hundred thirty million, forty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •