Base | Representation |
---|---|
bin | 10010101000000… |
… | …011111111000001 |
3 | 210210000020101122 |
4 | 102220003333001 |
5 | 1114444220334 |
6 | 51001442025 |
7 | 10513065206 |
oct | 2250037701 |
9 | 723006348 |
10 | 312491969 |
11 | 150436929 |
12 | 887a0315 |
13 | 4c9829ba |
14 | 2d705cad |
15 | 1c67a32e |
hex | 12a03fc1 |
312491969 has 2 divisors, whose sum is σ = 312491970. Its totient is φ = 312491968.
The previous prime is 312491957. The next prime is 312491981. The reversal of 312491969 is 969194213.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (312491957) and next prime (312491981).
It can be written as a sum of positive squares in only one way, i.e., 175297600 + 137194369 = 13240^2 + 11713^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312491969 is a prime.
It is a super-2 number, since 2×3124919692 = 195302461378993922, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (312491939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156245984 + 156245985.
It is an arithmetic number, because the mean of its divisors is an integer number (156245985).
Almost surely, 2312491969 is an apocalyptic number.
It is an amenable number.
312491969 is a deficient number, since it is larger than the sum of its proper divisors (1).
312491969 is an equidigital number, since it uses as much as digits as its factorization.
312491969 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 104976, while the sum is 44.
The square root of 312491969 is about 17677.4423772219. The cubic root of 312491969 is about 678.5985909022.
The spelling of 312491969 in words is "three hundred twelve million, four hundred ninety-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •