Base | Representation |
---|---|
bin | 1001000110110101000… |
… | …0110100110111100000 |
3 | 112221211101221112110110 |
4 | 2101231100310313200 |
5 | 10030403144400143 |
6 | 155512324131320 |
7 | 14206011430152 |
oct | 2215520646740 |
9 | 487741845413 |
10 | 156451950048 |
11 | 60395057779 |
12 | 263a3536b40 |
13 | 119a4178694 |
14 | 7802608ad2 |
15 | 410a23d533 |
hex | 246d434de0 |
156451950048 has 48 divisors (see below), whose sum is σ = 411062386896. Its totient is φ = 52102901760.
The previous prime is 156451950047. The next prime is 156451950091. The reversal of 156451950048 is 840059154651.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 156451949979 and 156451950006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156451950043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 640593 + ... + 850448.
It is an arithmetic number, because the mean of its divisors is an integer number (8563799727).
Almost surely, 2156451950048 is an apocalyptic number.
It is an amenable number.
156451950048 is an abundant number, since it is smaller than the sum of its proper divisors (254610436848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156451950048 is a wasteful number, since it uses less digits than its factorization.
156451950048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1492147 (or 1492139 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 48.
The spelling of 156451950048 in words is "one hundred fifty-six billion, four hundred fifty-one million, nine hundred fifty thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •