Base | Representation |
---|---|
bin | 10010100110100… |
… | …111110100100101 |
3 | 210202022001120011 |
4 | 102212213310211 |
5 | 1114400130334 |
6 | 50545410221 |
7 | 10506633502 |
oct | 2246476445 |
9 | 722261504 |
10 | 312114469 |
11 | 1501a9247 |
12 | 88639971 |
13 | 4c87cc24 |
14 | 2d6484a9 |
15 | 1c603564 |
hex | 129a7d25 |
312114469 has 2 divisors, whose sum is σ = 312114470. Its totient is φ = 312114468.
The previous prime is 312114391. The next prime is 312114497. The reversal of 312114469 is 964411213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 177902244 + 134212225 = 13338^2 + 11585^2 .
It is a cyclic number.
It is not a de Polignac number, because 312114469 - 29 = 312113957 is a prime.
It is a super-2 number, since 2×3121144692 = 194830883518303922, 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 312114469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313114469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156057234 + 156057235.
It is an arithmetic number, because the mean of its divisors is an integer number (156057235).
Almost surely, 2312114469 is an apocalyptic number.
It is an amenable number.
312114469 is a deficient number, since it is larger than the sum of its proper divisors (1).
312114469 is an equidigital number, since it uses as much as digits as its factorization.
312114469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 31.
The square root of 312114469 is about 17666.7617010023. The cubic root of 312114469 is about 678.3252247393.
It can be divided in two parts, 3121144 and 69, that added together give a palindrome (3121213).
The spelling of 312114469 in words is "three hundred twelve million, one hundred fourteen thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •