Base | Representation |
---|---|
bin | 11100110111110000… |
… | …00001001000111110 |
3 | 1111000020002101022220 |
4 | 32123320001020332 |
5 | 223221003230402 |
6 | 11042015550210 |
7 | 1056051203010 |
oct | 163370011076 |
9 | 44006071286 |
10 | 15500055102 |
11 | 66344168a4 |
12 | 3006b2b366 |
13 | 160032024c |
14 | a707d21b0 |
15 | 60ab8ddbc |
hex | 39be0123e |
15500055102 has 64 divisors (see below), whose sum is σ = 36043359744. Its totient is φ = 4352071680.
The previous prime is 15500055089. The next prime is 15500055113. The reversal of 15500055102 is 20155000551.
15500055102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 1212102 + ... + 1224822.
It is an arithmetic number, because the mean of its divisors is an integer number (563177496).
Almost surely, 215500055102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15500055102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18021679872).
15500055102 is an abundant number, since it is smaller than the sum of its proper divisors (20543304642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15500055102 is a wasteful number, since it uses less digits than its factorization.
15500055102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13233.
The product of its (nonzero) digits is 1250, while the sum is 24.
Adding to 15500055102 its reverse (20155000551), we get a palindrome (35655055653).
The spelling of 15500055102 in words is "fifteen billion, five hundred million, fifty-five thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •