Base | Representation |
---|---|
bin | 1100101011111… |
… | …01010110011011 |
3 | 21102020200021002 |
4 | 12111331112123 |
5 | 204220411421 |
6 | 14320535215 |
7 | 2431360154 |
oct | 625752633 |
9 | 242220232 |
10 | 106419611 |
11 | 550866a1 |
12 | 2b78150b |
13 | 190807ac |
14 | 101c292b |
15 | 9521b0b |
hex | 657d59b |
106419611 has 2 divisors, whose sum is σ = 106419612. Its totient is φ = 106419610.
The previous prime is 106419571. The next prime is 106419623. The reversal of 106419611 is 116914601.
It is a strong prime.
It is an emirp because it is prime and its reverse (116914601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106419611 is a prime.
It is a super-2 number, since 2×1064196112 = 22650267210782642, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (106419011) 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, 53209805 + 53209806.
It is an arithmetic number, because the mean of its divisors is an integer number (53209806).
Almost surely, 2106419611 is an apocalyptic number.
106419611 is a deficient number, since it is larger than the sum of its proper divisors (1).
106419611 is an equidigital number, since it uses as much as digits as its factorization.
106419611 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 29.
The square root of 106419611 is about 10315.9881252355. The cubic root of 106419611 is about 473.8860114489.
The spelling of 106419611 in words is "one hundred six million, four hundred nineteen thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •