Base | Representation |
---|---|
bin | 11100010011111111… |
… | …00110011100010010 |
3 | 1110020022120200211022 |
4 | 32021333212130102 |
5 | 222112203144020 |
6 | 10552141515442 |
7 | 1045446214232 |
oct | 161177463422 |
9 | 43208520738 |
10 | 15200053010 |
11 | 64a004088a |
12 | 2b42572b82 |
13 | 158312150c |
14 | a42a1bcc2 |
15 | 5de67e625 |
hex | 389fe6712 |
15200053010 has 48 divisors (see below), whose sum is σ = 30131528256. Its totient is φ = 5509554336.
The previous prime is 15200052997. The next prime is 15200053061. The reversal of 15200053010 is 1035000251.
It is a super-2 number, since 2×152000530102 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 15200053010.
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 23 ways as a sum of consecutive naturals, for example, 8504 + ... + 174563.
It is an arithmetic number, because the mean of its divisors is an integer number (627740172).
Almost surely, 215200053010 is an apocalyptic number.
15200053010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15200053010 is a deficient number, since it is larger than the sum of its proper divisors (14931475246).
15200053010 is a wasteful number, since it uses less digits than its factorization.
15200053010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183135 (or 183116 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 17.
Adding to 15200053010 its reverse (1035000251), we get a palindrome (16235053261).
The spelling of 15200053010 in words is "fifteen billion, two hundred million, fifty-three thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •