Base | Representation |
---|---|
bin | 110001101001100010… |
… | …1010100101011011101 |
3 | 101012012120110211022222 |
4 | 1203103011110223131 |
5 | 3221324333244401 |
6 | 120551505315125 |
7 | 10463105113235 |
oct | 1432305245335 |
9 | 335176424288 |
10 | 106620603101 |
11 | 41243607211 |
12 | 187b7035aa5 |
13 | a092338b7c |
14 | 523645acc5 |
15 | 2b905aec1b |
hex | 18d3154add |
106620603101 has 2 divisors, whose sum is σ = 106620603102. Its totient is φ = 106620603100.
The previous prime is 106620602971. The next prime is 106620603143. The reversal of 106620603101 is 101306026601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106373170201 + 247432900 = 326149^2 + 15730^2 .
It is a cyclic number.
It is not a de Polignac number, because 106620603101 - 214 = 106620586717 is a prime.
It is a super-2 number, since 2×1066206031012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106620603301) 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, 53310301550 + 53310301551.
It is an arithmetic number, because the mean of its divisors is an integer number (53310301551).
Almost surely, 2106620603101 is an apocalyptic number.
It is an amenable number.
106620603101 is a deficient number, since it is larger than the sum of its proper divisors (1).
106620603101 is an equidigital number, since it uses as much as digits as its factorization.
106620603101 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 26.
Adding to 106620603101 its reverse (101306026601), we get a palindrome (207926629702).
The spelling of 106620603101 in words is "one hundred six billion, six hundred twenty million, six hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •