Base | Representation |
---|---|
bin | 1101101010000101011001… |
… | …1000110011101101100000 |
3 | 1222011120121111200120202002 |
4 | 3122201112120303231200 |
5 | 3432013102140320111 |
6 | 51534320040143132 |
7 | 3106626465353015 |
oct | 332412630635540 |
9 | 58146544616662 |
10 | 15016655010656 |
11 | 486a5892a75a2 |
12 | 18263b3467aa8 |
13 | 84c0ab8c2580 |
14 | 39cb4a82d70c |
15 | 1b093e8e263b |
hex | da856633b60 |
15016655010656 has 24 divisors (see below), whose sum is σ = 31838196441744. Its totient is φ = 6930763850880.
The previous prime is 15016655010641. The next prime is 15016655010659. The reversal of 15016655010656 is 65601055661051.
It is a self number, because there is not a number n which added to its sum of digits gives 15016655010656.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15016655010659) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18048863780 + ... + 18048864611.
It is an arithmetic number, because the mean of its divisors is an integer number (1326591518406).
Almost surely, 215016655010656 is an apocalyptic number.
15016655010656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
15016655010656 is an abundant number, since it is smaller than the sum of its proper divisors (16821541431088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15016655010656 is a wasteful number, since it uses less digits than its factorization.
15016655010656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36097728414 (or 36097728406 counting only the distinct ones).
The product of its (nonzero) digits is 810000, while the sum is 47.
The spelling of 15016655010656 in words is "fifteen trillion, sixteen billion, six hundred fifty-five million, ten thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •