Base | Representation |
---|---|
bin | 1001010000110100101… |
… | …0011000011001101110 |
3 | 120012202100212001011012 |
4 | 2110031022120121232 |
5 | 10101401430141100 |
6 | 201034435025222 |
7 | 14332334624210 |
oct | 2241512303156 |
9 | 505670761135 |
10 | 159134615150 |
11 | 61541383775 |
12 | 26a11a3b212 |
13 | 12010ba2a94 |
14 | 79b8a085b0 |
15 | 42159ec135 |
hex | 250d29866e |
159134615150 has 36 divisors (see below), whose sum is σ = 338290589832. Its totient is φ = 54557880720.
The previous prime is 159134615147. The next prime is 159134615183. The reversal of 159134615150 is 51516431951.
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 159134615098 and 159134615107.
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 17 ways as a sum of consecutive naturals, for example, 7452389 + ... + 7473711.
Almost surely, 2159134615150 is an apocalyptic number.
159134615150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
159134615150 is an abundant number, since it is smaller than the sum of its proper divisors (179155974682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
159134615150 is an frugal number, since it uses more digits than its factorization.
159134615150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42665 (or 21337 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 41.
The spelling of 159134615150 in words is "one hundred fifty-nine billion, one hundred thirty-four million, six hundred fifteen thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •