Base | Representation |
---|---|
bin | 1001001001111100100… |
… | …0110001110110000000 |
3 | 120000222201102220102000 |
4 | 2102133020301312000 |
5 | 10034111401420222 |
6 | 200131334424000 |
7 | 14235521621211 |
oct | 2223710616600 |
9 | 500881386360 |
10 | 157288701312 |
11 | 6078440a346 |
12 | 26597802000 |
13 | 11aa8628482 |
14 | 78817bd408 |
15 | 41589249ac |
hex | 249f231d80 |
157288701312 has 256 divisors, whose sum is σ = 472456492800. Its totient is φ = 51505238016.
The previous prime is 157288701293. The next prime is 157288701343. The reversal of 157288701312 is 213107882751.
157288701312 is a `hidden beast` number, since 1 + 57 + 288 + 7 + 0 + 1 + 312 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 71396403 + ... + 71398605.
It is an arithmetic number, because the mean of its divisors is an integer number (1845533175).
Almost surely, 2157288701312 is an apocalyptic number.
157288701312 is a gapful number since it is divisible by the number (12) 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 157288701312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (236228246400).
157288701312 is an abundant number, since it is smaller than the sum of its proper divisors (315167791488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157288701312 is a wasteful number, since it uses less digits than its factorization.
157288701312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2582 (or 2564 counting only the distinct ones).
The product of its (nonzero) digits is 188160, while the sum is 45.
The spelling of 157288701312 in words is "one hundred fifty-seven billion, two hundred eighty-eight million, seven hundred one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •