Base | Representation |
---|---|
bin | 1100101111101… |
… | …01101110001011 |
3 | 21110011201120211 |
4 | 12113311232023 |
5 | 204332201101 |
6 | 14335301551 |
7 | 2435512456 |
oct | 627655613 |
9 | 243151524 |
10 | 106912651 |
11 | 5539306a |
12 | 2b97a8b7 |
13 | 191c4031 |
14 | 102b049d |
15 | 95bcc51 |
hex | 65f5b8b |
106912651 has 2 divisors, whose sum is σ = 106912652. Its totient is φ = 106912650.
The previous prime is 106912649. The next prime is 106912657. The reversal of 106912651 is 156219601.
It is a weak prime.
It is an emirp because it is prime and its reverse (156219601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 106912651 - 21 = 106912649 is a prime.
It is a super-2 number, since 2×1069126512 = 22860629887695602, which contains 22 as substring.
Together with 106912649, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (106912657) 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, 53456325 + 53456326.
It is an arithmetic number, because the mean of its divisors is an integer number (53456326).
Almost surely, 2106912651 is an apocalyptic number.
106912651 is the 6540-th centered pentagonal number.
106912651 is a deficient number, since it is larger than the sum of its proper divisors (1).
106912651 is an equidigital number, since it uses as much as digits as its factorization.
106912651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 31.
The square root of 106912651 is about 10339.8573974693. The cubic root of 106912651 is about 474.6167190659.
The spelling of 106912651 in words is "one hundred six million, nine hundred twelve thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •