Base | Representation |
---|---|
bin | 10010001000100… |
… | …00111111011101 |
3 | 101121020010222011 |
4 | 21010100333131 |
5 | 302420104432 |
6 | 23032151221 |
7 | 3524640322 |
oct | 1104207735 |
9 | 347203864 |
10 | 152113117 |
11 | 78955922 |
12 | 42b38511 |
13 | 2568b980 |
14 | 162b8b49 |
15 | d54a847 |
hex | 9110fdd |
152113117 has 8 divisors (see below), whose sum is σ = 163947224. Its totient is φ = 140298048.
The previous prime is 152113109. The next prime is 152113133. The reversal of 152113117 is 711311251.
152113117 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 56640676 + 95472441 = 7526^2 + 9771^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 152113117 - 23 = 152113109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152113147) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14863 + ... + 22915.
It is an arithmetic number, because the mean of its divisors is an integer number (20493403).
Almost surely, 2152113117 is an apocalyptic number.
It is an amenable number.
152113117 is a deficient number, since it is larger than the sum of its proper divisors (11834107).
152113117 is a wasteful number, since it uses less digits than its factorization.
152113117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9519.
The product of its digits is 210, while the sum is 22.
The square root of 152113117 is about 12333.4146528851. The cubic root of 152113117 is about 533.8126835796.
Adding to 152113117 its reverse (711311251), we get a palindrome (863424368).
The spelling of 152113117 in words is "one hundred fifty-two million, one hundred thirteen thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •