Base | Representation |
---|---|
bin | 11100001011111001… |
… | …11010100101001000 |
3 | 1110001120222110010202 |
4 | 32011330322211020 |
5 | 221442323141300 |
6 | 10541320231332 |
7 | 1043663630240 |
oct | 160574724510 |
9 | 43046873122 |
10 | 15132240200 |
11 | 6465834040 |
12 | 2b2390b548 |
13 | 157206a3ac |
14 | a37a08b20 |
15 | 5d8736ad5 |
hex | 385f3a948 |
15132240200 has 96 divisors (see below), whose sum is σ = 43863888960. Its totient is φ = 4716537600.
The previous prime is 15132240187. The next prime is 15132240289. The reversal of 15132240200 is 204223151.
15132240200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 475907 + ... + 506706.
It is an arithmetic number, because the mean of its divisors is an integer number (456915510).
Almost surely, 215132240200 is an apocalyptic number.
15132240200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
15132240200 is an abundant number, since it is smaller than the sum of its proper divisors (28731648760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15132240200 is a wasteful number, since it uses less digits than its factorization.
15132240200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 982647 (or 982638 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 15132240200 its reverse (204223151), we get a palindrome (15336463351).
The spelling of 15132240200 in words is "fifteen billion, one hundred thirty-two million, two hundred forty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •