Base | Representation |
---|---|
bin | 1001010000111100111… |
… | …1101010111111100011 |
3 | 120012211210121020121110 |
4 | 2110033033222333203 |
5 | 10101434401301301 |
6 | 201042123554403 |
7 | 14333240622663 |
oct | 2241717527743 |
9 | 505753536543 |
10 | 159169556451 |
11 | 6155a079684 |
12 | 26a2168ba03 |
13 | 120181b7bc9 |
14 | 79bd5021a3 |
15 | 4218b000d6 |
hex | 250f3eafe3 |
159169556451 has 48 divisors (see below), whose sum is σ = 223720993440. Its totient is φ = 100629273600.
The previous prime is 159169556353. The next prime is 159169556453. The reversal of 159169556451 is 154655961951.
It is not a de Polignac number, because 159169556451 - 217 = 159169425379 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 159169556391 and 159169556400.
It is not an unprimeable number, because it can be changed into a prime (159169556453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 51526315 + ... + 51529403.
It is an arithmetic number, because the mean of its divisors is an integer number (4660854030).
Almost surely, 2159169556451 is an apocalyptic number.
159169556451 is a deficient number, since it is larger than the sum of its proper divisors (64551436989).
159169556451 is a wasteful number, since it uses less digits than its factorization.
159169556451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3508 (or 3477 counting only the distinct ones).
The product of its digits is 7290000, while the sum is 57.
The spelling of 159169556451 in words is "one hundred fifty-nine billion, one hundred sixty-nine million, five hundred fifty-six thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •