Base | Representation |
---|---|
bin | 100011110110111100001001… |
… | …100101111111101110100000 |
3 | 202200101122111112011021210110 |
4 | 203312330021211333232200 |
5 | 131132333032131101440 |
6 | 1315225343040331320 |
7 | 45134650043163120 |
oct | 4366741145775640 |
9 | 680348445137713 |
10 | 157707065097120 |
11 | 46283210918240 |
12 | 15830829013b40 |
13 | 69cc93527a3c6 |
14 | 2ad30c3dbac80 |
15 | 13374c90ad080 |
hex | 8f6f0997fba0 |
157707065097120 has 768 divisors, whose sum is σ = 622883682570240. Its totient is φ = 32584185446400.
The previous prime is 157707065097017. The next prime is 157707065097163. The reversal of 157707065097120 is 21790560707751.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 6364019130 + ... + 6364043910.
It is an arithmetic number, because the mean of its divisors is an integer number (811046461680).
Almost surely, 2157707065097120 is an apocalyptic number.
157707065097120 is a gapful number since it is divisible by the number (10) 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 157707065097120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (311441841285120).
157707065097120 is an abundant number, since it is smaller than the sum of its proper divisors (465176617473120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
157707065097120 is a wasteful number, since it uses less digits than its factorization.
157707065097120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25789 (or 25781 counting only the distinct ones).
The product of its (nonzero) digits is 6482700, while the sum is 57.
The spelling of 157707065097120 in words is "one hundred fifty-seven trillion, seven hundred seven billion, sixty-five million, ninety-seven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •