Base | Representation |
---|---|
bin | 1001010000011000000… |
… | …0010111000110001010 |
3 | 120012102222220222210011 |
4 | 2110012000113012022 |
5 | 10101130211012400 |
6 | 201014505342134 |
7 | 14326346232604 |
oct | 2240600270612 |
9 | 505388828704 |
10 | 159014547850 |
11 | 6148a6263a4 |
12 | 2699979794a |
13 | 11cc2054342 |
14 | 79a6ab2174 |
15 | 420a1d18ba |
hex | 250601718a |
159014547850 has 12 divisors (see below), whose sum is σ = 295767059094. Its totient is φ = 63605819120.
The previous prime is 159014547847. The next prime is 159014547869. The reversal of 159014547850 is 58745410951.
It can be written as a sum of positive squares in 3 ways, for example, as 154805263209 + 4209284641 = 393453^2 + 64879^2 .
It is a junction number, because it is equal to n+sod(n) for n = 159014547794 and 159014547803.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1590145429 + ... + 1590145528.
Almost surely, 2159014547850 is an apocalyptic number.
159014547850 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
159014547850 is a deficient number, since it is larger than the sum of its proper divisors (136752511244).
159014547850 is a wasteful number, since it uses less digits than its factorization.
159014547850 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3180290969 (or 3180290964 counting only the distinct ones).
The product of its (nonzero) digits is 1008000, while the sum is 49.
The spelling of 159014547850 in words is "one hundred fifty-nine billion, fourteen million, five hundred forty-seven thousand, eight hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •