Base | Representation |
---|---|
bin | 1111000110011… |
… | …11110010100111 |
3 | 22211101000121102 |
4 | 13203033302213 |
5 | 224412231411 |
6 | 20323110315 |
7 | 3065523056 |
oct | 743176247 |
9 | 284330542 |
10 | 126680231 |
11 | 65564807 |
12 | 3651239b |
13 | 20325722 |
14 | 12b7839d |
15 | b1c4d3b |
hex | 78cfca7 |
126680231 has 2 divisors, whose sum is σ = 126680232. Its totient is φ = 126680230.
The previous prime is 126680227. The next prime is 126680233. The reversal of 126680231 is 132086621.
It is a strong prime.
It is an emirp because it is prime and its reverse (132086621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 126680231 - 22 = 126680227 is a prime.
It is a super-2 number, since 2×1266802312 = 32095761852426722, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 126680233, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 126680194 and 126680203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126680233) 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, 63340115 + 63340116.
It is an arithmetic number, because the mean of its divisors is an integer number (63340116).
Almost surely, 2126680231 is an apocalyptic number.
126680231 is a deficient number, since it is larger than the sum of its proper divisors (1).
126680231 is an equidigital number, since it uses as much as digits as its factorization.
126680231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 29.
The square root of 126680231 is about 11255.2312726127. The cubic root of 126680231 is about 502.2303443354.
The spelling of 126680231 in words is "one hundred twenty-six million, six hundred eighty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •