Base | Representation |
---|---|
bin | 10010010000001… |
… | …01111000110101 |
3 | 101200010002221212 |
4 | 21020011320311 |
5 | 303144204323 |
6 | 23105451205 |
7 | 3536315645 |
oct | 1110057065 |
9 | 350102855 |
10 | 153116213 |
11 | 79480528 |
12 | 43340b05 |
13 | 25950413 |
14 | 1649a525 |
15 | d697b78 |
hex | 9205e35 |
153116213 has 2 divisors, whose sum is σ = 153116214. Its totient is φ = 153116212.
The previous prime is 153116207. The next prime is 153116219. The reversal of 153116213 is 312611351.
It is a balanced prime because it is at equal distance from previous prime (153116207) and next prime (153116219).
It can be written as a sum of positive squares in only one way, i.e., 106357969 + 46758244 = 10313^2 + 6838^2 .
It is a cyclic number.
It is not a de Polignac number, because 153116213 - 210 = 153115189 is a prime.
It is a super-2 number, since 2×1531162132 = 46889149366922738, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153116219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76558106 + 76558107.
It is an arithmetic number, because the mean of its divisors is an integer number (76558107).
Almost surely, 2153116213 is an apocalyptic number.
It is an amenable number.
153116213 is a deficient number, since it is larger than the sum of its proper divisors (1).
153116213 is an equidigital number, since it uses as much as digits as its factorization.
153116213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 540, while the sum is 23.
The square root of 153116213 is about 12374.0136172545. The cubic root of 153116213 is about 534.9835066392.
Adding to 153116213 its reverse (312611351), we get a palindrome (465727564).
The spelling of 153116213 in words is "one hundred fifty-three million, one hundred sixteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •