Base | Representation |
---|---|
bin | 10010101011000… |
… | …11100111100000 |
3 | 101220202102201101 |
4 | 21111203213200 |
5 | 310100131411 |
6 | 23313244144 |
7 | 3611316313 |
oct | 1125434740 |
9 | 356672641 |
10 | 156645856 |
11 | 80471394 |
12 | 44563654 |
13 | 265b7b73 |
14 | 16b3897a |
15 | db438c1 |
hex | 95639e0 |
156645856 has 24 divisors (see below), whose sum is σ = 308972664. Its totient is φ = 78176640.
The previous prime is 156645787. The next prime is 156645857. The reversal of 156645856 is 658546651.
156645856 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156645857) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 13986 + ... + 22558.
It is an arithmetic number, because the mean of its divisors is an integer number (12873861).
Almost surely, 2156645856 is an apocalyptic number.
156645856 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
156645856 is a deficient number, since it is larger than the sum of its proper divisors (152326808).
156645856 is an equidigital number, since it uses as much as digits as its factorization.
156645856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9154 (or 9146 counting only the distinct ones).
The product of its digits is 864000, while the sum is 46.
The square root of 156645856 is about 12515.8242237577. The cubic root of 156645856 is about 539.0631400751.
The spelling of 156645856 in words is "one hundred fifty-six million, six hundred forty-five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •