Base | Representation |
---|---|
bin | 10010101011111… |
… | …00100011110000 |
3 | 101220221121212002 |
4 | 21111330203300 |
5 | 310111414031 |
6 | 23315353132 |
7 | 3612223205 |
oct | 1125744360 |
9 | 356847762 |
10 | 156748016 |
11 | 80531117 |
12 | 445b27a8 |
13 | 26622509 |
14 | 16b63cac |
15 | db63ccb |
hex | 957c8f0 |
156748016 has 40 divisors (see below), whose sum is σ = 315381600. Its totient is φ = 75380480.
The previous prime is 156748003. The next prime is 156748051. The reversal of 156748016 is 610847651.
156748016 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 166106 + ... + 167046.
It is an arithmetic number, because the mean of its divisors is an integer number (7884540).
Almost surely, 2156748016 is an apocalyptic number.
156748016 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 156748016, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157690800).
156748016 is an abundant number, since it is smaller than the sum of its proper divisors (158633584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156748016 is a wasteful number, since it uses less digits than its factorization.
156748016 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1337 (or 1331 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 156748016 is about 12519.9047919703. The cubic root of 156748016 is about 539.1803018571.
The spelling of 156748016 in words is "one hundred fifty-six million, seven hundred forty-eight thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •