Base | Representation |
---|---|
bin | 10010001011001… |
… | …11111101000001 |
3 | 101121220020120121 |
4 | 21011213331001 |
5 | 303013004223 |
6 | 23043540241 |
7 | 3530652643 |
oct | 1105477501 |
9 | 347806517 |
10 | 152469313 |
11 | 790794a7 |
12 | 4308a681 |
13 | 25784b39 |
14 | 1636c893 |
15 | d5bb15d |
hex | 9167f41 |
152469313 has 2 divisors, whose sum is σ = 152469314. Its totient is φ = 152469312.
The previous prime is 152469307. The next prime is 152469347. The reversal of 152469313 is 313964251.
152469313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (152469347) can be obtained adding 152469313 to its sum of digits (34).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 143808064 + 8661249 = 11992^2 + 2943^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-152469313 is a prime.
It is a super-3 number, since 3×1524693133 (a number of 26 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (152469113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76234656 + 76234657.
It is an arithmetic number, because the mean of its divisors is an integer number (76234657).
Almost surely, 2152469313 is an apocalyptic number.
It is an amenable number.
152469313 is a deficient number, since it is larger than the sum of its proper divisors (1).
152469313 is an equidigital number, since it uses as much as digits as its factorization.
152469313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 19440, while the sum is 34.
The square root of 152469313 is about 12347.8464924051. The cubic root of 152469313 is about 534.2290266357.
The spelling of 152469313 in words is "one hundred fifty-two million, four hundred sixty-nine thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •