Base | Representation |
---|---|
bin | 1001000110001001000… |
… | …0000100011001010000 |
3 | 112221100112022100221220 |
4 | 2101202100010121100 |
5 | 10030013400432003 |
6 | 155442124245040 |
7 | 14201306205402 |
oct | 2214220043120 |
9 | 487315270856 |
10 | 156267202128 |
11 | 602aa841944 |
12 | 263516a0780 |
13 | 11974b0169b |
14 | 77c5c76b72 |
15 | 40e8de8353 |
hex | 2462404650 |
156267202128 has 80 divisors (see below), whose sum is σ = 424575254016. Its totient is φ = 49457640960.
The previous prime is 156267202127. The next prime is 156267202129. The reversal of 156267202128 is 821202762651.
It is an interprime number because it is at equal distance from previous prime (156267202127) and next prime (156267202129).
It is a self number, because there is not a number n which added to its sum of digits gives 156267202128.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156267202127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 911875 + ... + 1069602.
Almost surely, 2156267202128 is an apocalyptic number.
It is an amenable number.
156267202128 is an abundant number, since it is smaller than the sum of its proper divisors (268308051888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156267202128 is a wasteful number, since it uses less digits than its factorization.
156267202128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1981572 (or 1981566 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 42.
Adding to 156267202128 its reverse (821202762651), we get a palindrome (977469964779).
The spelling of 156267202128 in words is "one hundred fifty-six billion, two hundred sixty-seven million, two hundred two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •