Base | Representation |
---|---|
bin | 1001000101001110101… |
… | …0110110110010011010 |
3 | 112220201110222120100010 |
4 | 2101103222312302122 |
5 | 10024013234103132 |
6 | 155401545022350 |
7 | 14162245633560 |
oct | 2212352666232 |
9 | 486643876303 |
10 | 156022566042 |
11 | 60194742162 |
12 | 262a37849b6 |
13 | 119362195c5 |
14 | 77a1595a30 |
15 | 40d26c36cc |
hex | 2453ab6c9a |
156022566042 has 64 divisors (see below), whose sum is σ = 359508720384. Its totient is φ = 44218137600.
The previous prime is 156022565953. The next prime is 156022566043. The reversal of 156022566042 is 240665220651.
156022566042 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1560225660422 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (156022566043) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 3890292 + ... + 3930192.
It is an arithmetic number, because the mean of its divisors is an integer number (5617323756).
Almost surely, 2156022566042 is an apocalyptic number.
156022566042 is an abundant number, since it is smaller than the sum of its proper divisors (203486154342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156022566042 is a wasteful number, since it uses less digits than its factorization.
156022566042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40663.
The product of its (nonzero) digits is 172800, while the sum is 39.
Adding to 156022566042 its reverse (240665220651), we get a palindrome (396687786693).
The spelling of 156022566042 in words is "one hundred fifty-six billion, twenty-two million, five hundred sixty-six thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •