Base | Representation |
---|---|
bin | 100011100010110101010010… |
… | …010001111110011100101000 |
3 | 202111111112221021222110222022 |
4 | 203202311102101332130220 |
5 | 130442213211102211311 |
6 | 1312250504224444012 |
7 | 44633062535141030 |
oct | 4342652221763450 |
9 | 674445837873868 |
10 | 156325305116456 |
11 | 458a020a3894a3 |
12 | 15648a84479608 |
13 | 692c54a5306a8 |
14 | 2a8628403a8c0 |
15 | 13115a74185db |
hex | 8e2d5247e728 |
156325305116456 has 64 divisors (see below), whose sum is σ = 337437575049600. Its totient is φ = 66505631634432.
The previous prime is 156325305116447. The next prime is 156325305116459. The reversal of 156325305116456 is 654611503523651.
It is a junction number, because it is equal to n+sod(n) for n = 156325305116398 and 156325305116407.
It is not an unprimeable number, because it can be changed into a prime (156325305116459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 286422335 + ... + 286967601.
It is an arithmetic number, because the mean of its divisors is an integer number (5272462110150).
Almost surely, 2156325305116456 is an apocalyptic number.
It is an amenable number.
156325305116456 is an abundant number, since it is smaller than the sum of its proper divisors (181112269933144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
156325305116456 is a wasteful number, since it uses less digits than its factorization.
156325305116456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 582786 (or 582782 counting only the distinct ones).
The product of its (nonzero) digits is 9720000, while the sum is 53.
The spelling of 156325305116456 in words is "one hundred fifty-six trillion, three hundred twenty-five billion, three hundred five million, one hundred sixteen thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •