Base | Representation |
---|---|
bin | 11100111000010101… |
… | …10110101000011100 |
3 | 1111000120101020120110 |
4 | 32130022312220130 |
5 | 223223234232141 |
6 | 11042313450020 |
7 | 1056141156426 |
oct | 163412665034 |
9 | 44016336513 |
10 | 15504992796 |
11 | 6637189637 |
12 | 3008710910 |
13 | 160135b867 |
14 | a71319816 |
15 | 60b316e16 |
hex | 39c2b6a1c |
15504992796 has 96 divisors (see below), whose sum is σ = 38416250880. Its totient is φ = 4858560000.
The previous prime is 15504992747. The next prime is 15504992809. The reversal of 15504992796 is 69729940551.
15504992796 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, 10714545 + ... + 10715991.
It is an arithmetic number, because the mean of its divisors is an integer number (400169280).
Almost surely, 215504992796 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15504992796, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19208125440).
15504992796 is an abundant number, since it is smaller than the sum of its proper divisors (22911258084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15504992796 is a wasteful number, since it uses less digits than its factorization.
15504992796 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2275 (or 2273 counting only the distinct ones).
The product of its (nonzero) digits is 6123600, while the sum is 57.
The spelling of 15504992796 in words is "fifteen billion, five hundred four million, nine hundred ninety-two thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •