Base | Representation |
---|---|
bin | 1001001010110110100… |
… | …1010011110111101001 |
3 | 120001121200110100210012 |
4 | 2102231221103313221 |
5 | 10040111210012223 |
6 | 200211431501305 |
7 | 14244535562354 |
oct | 2225551236751 |
9 | 501550410705 |
10 | 157532110313 |
11 | 60899851106 |
12 | 26645227835 |
13 | 11b16ba0b76 |
14 | 78a5c6129b |
15 | 416eea5c78 |
hex | 24ada53de9 |
157532110313 has 16 divisors (see below), whose sum is σ = 161694175104. Its totient is φ = 153385664640.
The previous prime is 157532110297. The next prime is 157532110321. The reversal of 157532110313 is 313011235751.
It is a cyclic number.
It is not a de Polignac number, because 157532110313 - 24 = 157532110297 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 157532110313.
It is not an unprimeable number, because it can be changed into a prime (157532110013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70420031 + ... + 70422267.
It is an arithmetic number, because the mean of its divisors is an integer number (10105885944).
Almost surely, 2157532110313 is an apocalyptic number.
It is an amenable number.
157532110313 is a deficient number, since it is larger than the sum of its proper divisors (4162064791).
157532110313 is a wasteful number, since it uses less digits than its factorization.
157532110313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4912.
The product of its (nonzero) digits is 9450, while the sum is 32.
The spelling of 157532110313 in words is "one hundred fifty-seven billion, five hundred thirty-two million, one hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •