Base | Representation |
---|---|
bin | 10010101100110… |
… | …100101111101101 |
3 | 210212100122201222 |
4 | 102230310233231 |
5 | 1120304142034 |
6 | 51044313125 |
7 | 10526514443 |
oct | 2254645755 |
9 | 725318658 |
10 | 313740269 |
11 | 151109787 |
12 | 890a27a5 |
13 | 4cccbc3b |
14 | 2d94cb93 |
15 | 1c82512e |
hex | 12b34bed |
313740269 has 2 divisors, whose sum is σ = 313740270. Its totient is φ = 313740268.
The previous prime is 313740257. The next prime is 313740277. The reversal of 313740269 is 962047313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 280964644 + 32775625 = 16762^2 + 5725^2 .
It is an emirp because it is prime and its reverse (962047313) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313740269 is a prime.
It is a super-2 number, since 2×3137402692 = 196865912784384722, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313745269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156870134 + 156870135.
It is an arithmetic number, because the mean of its divisors is an integer number (156870135).
Almost surely, 2313740269 is an apocalyptic number.
It is an amenable number.
313740269 is a deficient number, since it is larger than the sum of its proper divisors (1).
313740269 is an equidigital number, since it uses as much as digits as its factorization.
313740269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 35.
The square root of 313740269 is about 17712.7148963675. The cubic root of 313740269 is about 679.5009812024.
The spelling of 313740269 in words is "three hundred thirteen million, seven hundred forty thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •