Base | Representation |
---|---|
bin | 1001000101010110110… |
… | …0010011011101010010 |
3 | 112220210211211121001020 |
4 | 2101111230103131102 |
5 | 10024100431000200 |
6 | 155405200220310 |
7 | 14163140235543 |
oct | 2212554233522 |
9 | 486724747036 |
10 | 156056500050 |
11 | 6020190a2a0 |
12 | 262b300a696 |
13 | 1194026b0b9 |
14 | 77a5caa4ca |
15 | 40d5677ea0 |
hex | 2455b13752 |
156056500050 has 48 divisors (see below), whose sum is σ = 422203771872. Its totient is φ = 37831878400.
The previous prime is 156056500049. The next prime is 156056500051. The reversal of 156056500050 is 50005650651.
It is an interprime number because it is at equal distance from previous prime (156056500049) and next prime (156056500051).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 156056499984 and 156056500020.
It is not an unprimeable number, because it can be changed into a prime (156056500051) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 47288199 + ... + 47291498.
It is an arithmetic number, because the mean of its divisors is an integer number (8795911914).
Almost surely, 2156056500050 is an apocalyptic number.
156056500050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
156056500050 is an abundant number, since it is smaller than the sum of its proper divisors (266147271822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156056500050 is a wasteful number, since it uses less digits than its factorization.
156056500050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 94579723 (or 94579718 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 33.
The spelling of 156056500050 in words is "one hundred fifty-six billion, fifty-six million, five hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •