Base | Representation |
---|---|
bin | 10010001000100… |
… | …01010001011101 |
3 | 101121020012112211 |
4 | 21010101101131 |
5 | 302420124034 |
6 | 23032200421 |
7 | 3524643556 |
oct | 1104212135 |
9 | 347205484 |
10 | 152114269 |
11 | 7895677a |
12 | 42b39111 |
13 | 2568c358 |
14 | 162b932d |
15 | d54ad64 |
hex | 911145d |
152114269 has 2 divisors, whose sum is σ = 152114270. Its totient is φ = 152114268.
The previous prime is 152114201. The next prime is 152114279. The reversal of 152114269 is 962411251.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99261369 + 52852900 = 9963^2 + 7270^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152114269 is a prime.
It is a super-2 number, since 2×1521142692 = 46277501666808722, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 152114269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (152114279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76057134 + 76057135.
It is an arithmetic number, because the mean of its divisors is an integer number (76057135).
Almost surely, 2152114269 is an apocalyptic number.
It is an amenable number.
152114269 is a deficient number, since it is larger than the sum of its proper divisors (1).
152114269 is an equidigital number, since it uses as much as digits as its factorization.
152114269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4320, while the sum is 31.
The square root of 152114269 is about 12333.4613551914. The cubic root of 152114269 is about 533.8140311528.
The spelling of 152114269 in words is "one hundred fifty-two million, one hundred fourteen thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •