Base | Representation |
---|---|
bin | 1001001000011110011… |
… | …1101110100111001000 |
3 | 112222222020001012022220 |
4 | 2102013213232213020 |
5 | 10032304401130402 |
6 | 200024242214040 |
7 | 14222661240015 |
oct | 2220747564710 |
9 | 488866035286 |
10 | 156894161352 |
11 | 605a1733665 |
12 | 264a7654320 |
13 | 11a44979186 |
14 | 784523a70c |
15 | 4133e8ddbc |
hex | 24879ee9c8 |
156894161352 has 32 divisors (see below), whose sum is σ = 398665495680. Its totient is φ = 51440708160.
The previous prime is 156894161339. The next prime is 156894161363. The reversal of 156894161352 is 253161498651.
156894161352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 156894161295 and 156894161304.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 53582608 + ... + 53585535.
It is an arithmetic number, because the mean of its divisors is an integer number (12458296740).
Almost surely, 2156894161352 is an apocalyptic number.
156894161352 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
156894161352 is an abundant number, since it is smaller than the sum of its proper divisors (241771334328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156894161352 is a wasteful number, since it uses less digits than its factorization.
156894161352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107168213 (or 107168209 counting only the distinct ones).
The product of its digits is 1555200, while the sum is 51.
The spelling of 156894161352 in words is "one hundred fifty-six billion, eight hundred ninety-four million, one hundred sixty-one thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •