Base | Representation |
---|---|
bin | 11100001011100001… |
… | …10100110111011110 |
3 | 1110001101000102220120 |
4 | 32011300310313132 |
5 | 221441020233240 |
6 | 10541124255410 |
7 | 1043624660631 |
oct | 160560646736 |
9 | 43041012816 |
10 | 15129071070 |
11 | 6463a6a023 |
12 | 2b22841566 |
13 | 15714caa79 |
14 | a37421c18 |
15 | 5d830cad0 |
hex | 385c34dde |
15129071070 has 32 divisors (see below), whose sum is σ = 36541054368. Its totient is φ = 4008720768.
The previous prime is 15129071029. The next prime is 15129071071. The reversal of 15129071070 is 7017092151.
It is a super-2 number, since 2×151290710702 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15129071071) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1601349 + ... + 1610768.
It is an arithmetic number, because the mean of its divisors is an integer number (1141907949).
Almost surely, 215129071070 is an apocalyptic number.
15129071070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15129071070 is an abundant number, since it is smaller than the sum of its proper divisors (21411983298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15129071070 is a wasteful number, since it uses less digits than its factorization.
15129071070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3212284.
The product of its (nonzero) digits is 4410, while the sum is 33.
The spelling of 15129071070 in words is "fifteen billion, one hundred twenty-nine million, seventy-one thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •