Base | Representation |
---|---|
bin | 10010101100000… |
… | …01111101101000 |
3 | 101220222202012221 |
4 | 21112001331220 |
5 | 310113121102 |
6 | 23320043424 |
7 | 3612344560 |
oct | 1126017550 |
9 | 356882187 |
10 | 156770152 |
11 | 80546810 |
12 | 44603574 |
13 | 2662c606 |
14 | 16b6bda0 |
15 | db6a637 |
hex | 9581f68 |
156770152 has 64 divisors (see below), whose sum is σ = 369037440. Its totient is φ = 60652800.
The previous prime is 156770149. The next prime is 156770161. The reversal of 156770152 is 251077651.
It is a happy number.
It is a hoax number, since the sum of its digits (34) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95902 + ... + 97522.
It is an arithmetic number, because the mean of its divisors is an integer number (5766210).
Almost surely, 2156770152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 156770152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184518720).
156770152 is an abundant number, since it is smaller than the sum of its proper divisors (212267288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156770152 is a wasteful number, since it uses less digits than its factorization.
156770152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1802 (or 1798 counting only the distinct ones).
The product of its (nonzero) digits is 14700, while the sum is 34.
The square root of 156770152 is about 12520.7887930434. The cubic root of 156770152 is about 539.2056817283.
The spelling of 156770152 in words is "one hundred fifty-six million, seven hundred seventy thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •