Base | Representation |
---|---|
bin | 1001010010101110000… |
… | …0111101000101101110 |
3 | 120021001212001210202202 |
4 | 2110223200331011232 |
5 | 10103422311132240 |
6 | 201201145421502 |
7 | 14351060220206 |
oct | 2245340750556 |
9 | 507055053682 |
10 | 159643849070 |
11 | 61782877752 |
12 | 26b3449a892 |
13 | 1209253bb24 |
14 | 7a264c5406 |
15 | 424558b315 |
hex | 252b83d16e |
159643849070 has 16 divisors (see below), whose sum is σ = 287363607120. Its totient is φ = 63856499904.
The previous prime is 159643849063. The next prime is 159643849129. The reversal of 159643849070 is 70948346951.
159643849070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 159643848997 and 159643849015.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 915026 + ... + 1075434.
It is an arithmetic number, because the mean of its divisors is an integer number (17960225445).
Almost surely, 2159643849070 is an apocalyptic number.
159643849070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
159643849070 is a deficient number, since it is larger than the sum of its proper divisors (127719758050).
159643849070 is a wasteful number, since it uses less digits than its factorization.
159643849070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259939.
The product of its (nonzero) digits is 6531840, while the sum is 56.
The spelling of 159643849070 in words is "one hundred fifty-nine billion, six hundred forty-three million, eight hundred forty-nine thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •