Base | Representation |
---|---|
bin | 1100101101110… |
… | …11101101111011 |
3 | 21102201122200102 |
4 | 12112323231323 |
5 | 204302100232 |
6 | 14330230015 |
7 | 2433503012 |
oct | 626735573 |
9 | 242648612 |
10 | 106675067 |
11 | 55240614 |
12 | 2b88530b |
13 | 1913cb55 |
14 | 1024ba79 |
15 | 9572662 |
hex | 65bbb7b |
106675067 has 2 divisors, whose sum is σ = 106675068. Its totient is φ = 106675066.
The previous prime is 106675057. The next prime is 106675069. The reversal of 106675067 is 760576601.
It is a strong prime.
It is an emirp because it is prime and its reverse (760576601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106675067 is a prime.
It is a super-2 number, since 2×1066750672 = 22759139838908978, which contains 22 as substring.
Together with 106675069, it forms a pair of twin primes.
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 106675067.
It is not a weakly prime, because it can be changed into another prime (106675069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53337533 + 53337534.
It is an arithmetic number, because the mean of its divisors is an integer number (53337534).
Almost surely, 2106675067 is an apocalyptic number.
106675067 is a deficient number, since it is larger than the sum of its proper divisors (1).
106675067 is an equidigital number, since it uses as much as digits as its factorization.
106675067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52920, while the sum is 38.
The square root of 106675067 is about 10328.3622612687. The cubic root of 106675067 is about 474.2648898925.
The spelling of 106675067 in words is "one hundred six million, six hundred seventy-five thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •