Base | Representation |
---|---|
bin | 11100000001100000… |
… | …01110110000101100 |
3 | 1102211111212122201220 |
4 | 32000300032300230 |
5 | 221303011411113 |
6 | 10524523103340 |
7 | 1041554431020 |
oct | 160060166054 |
9 | 42744778656 |
10 | 15045028908 |
11 | 6420587998 |
12 | 2aba671b50 |
13 | 1559c83890 |
14 | a2a1c6380 |
15 | 5d0c5b523 |
hex | 380c0ec2c |
15045028908 has 48 divisors (see below), whose sum is σ = 43206240000. Its totient is φ = 3967919424.
The previous prime is 15045028907. The next prime is 15045028909. The reversal of 15045028908 is 80982054051.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (15045028907) and next prime (15045028909).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 15045028908.
It is not an unprimeable number, because it can be changed into a prime (15045028907) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 6887658 + ... + 6889841.
It is an arithmetic number, because the mean of its divisors is an integer number (900130000).
Almost surely, 215045028908 is an apocalyptic number.
It is an amenable number.
15045028908 is an abundant number, since it is smaller than the sum of its proper divisors (28161211092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15045028908 is a wasteful number, since it uses less digits than its factorization.
15045028908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13777526 (or 13777524 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 42.
The spelling of 15045028908 in words is "fifteen billion, forty-five million, twenty-eight thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •