Base | Representation |
---|---|
bin | 10011110111000101… |
… | …01111101001100111 |
3 | 1000112002122020122011 |
4 | 21323202233221213 |
5 | 133314113441411 |
6 | 4522013215051 |
7 | 525141642445 |
oct | 117342575147 |
9 | 30462566564 |
10 | 10662640231 |
11 | 4581867471 |
12 | 2096a91487 |
13 | 100c078999 |
14 | 732173b95 |
15 | 426150c21 |
hex | 27b8afa67 |
10662640231 has 2 divisors, whose sum is σ = 10662640232. Its totient is φ = 10662640230.
The previous prime is 10662640207. The next prime is 10662640243. The reversal of 10662640231 is 13204626601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10662640231 - 27 = 10662640103 is a prime.
It is a super-2 number, since 2×106626402312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10662640193 and 10662640202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10662640631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5331320115 + 5331320116.
It is an arithmetic number, because the mean of its divisors is an integer number (5331320116).
Almost surely, 210662640231 is an apocalyptic number.
10662640231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10662640231 is an equidigital number, since it uses as much as digits as its factorization.
10662640231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 10662640231 in words is "ten billion, six hundred sixty-two million, six hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •