Base | Representation |
---|---|
bin | 11100000010110000… |
… | …01011100101011000 |
3 | 1102212020120201122110 |
4 | 32001120023211120 |
5 | 221313202023111 |
6 | 10525535352320 |
7 | 1042042436556 |
oct | 160130134530 |
9 | 42766521573 |
10 | 15055501656 |
11 | 6426490258 |
12 | 2b020826a0 |
13 | 155c1ac680 |
14 | a2b750bd6 |
15 | 5d1b295a6 |
hex | 38160b958 |
15055501656 has 128 divisors (see below), whose sum is σ = 42894028800. Its totient is φ = 4365342720.
The previous prime is 15055501651. The next prime is 15055501691. The reversal of 15055501656 is 65610555051.
It is a super-2 number, since 2×150555016562 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15055501651) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1125600 + ... + 1138896.
It is an arithmetic number, because the mean of its divisors is an integer number (335109600).
Almost surely, 215055501656 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 15055501656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21447014400).
15055501656 is an abundant number, since it is smaller than the sum of its proper divisors (27838527144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15055501656 is a wasteful number, since it uses less digits than its factorization.
15055501656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13529 (or 13525 counting only the distinct ones).
The product of its (nonzero) digits is 112500, while the sum is 39.
The spelling of 15055501656 in words is "fifteen billion, fifty-five million, five hundred one thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •