Base | Representation |
---|---|
bin | 110001101001110000… |
… | …1010111101111001001 |
3 | 101012020002022101010212 |
4 | 1203103201113233021 |
5 | 3221333224040112 |
6 | 120552331050505 |
7 | 10463224445246 |
oct | 1432341275711 |
9 | 335202271125 |
10 | 106627955657 |
11 | 41247779303 |
12 | 187b95a0a35 |
13 | a093a116b2 |
14 | 52374125cd |
15 | 2b91063522 |
hex | 18d3857bc9 |
106627955657 has 4 divisors (see below), whose sum is σ = 109107675600. Its totient is φ = 104148235716.
The previous prime is 106627955591. The next prime is 106627955683. The reversal of 106627955657 is 756559726601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 106627955657 - 224 = 106611178441 is a prime.
It is a super-2 number, since 2×1066279556572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106627955596 and 106627955605.
It is not an unprimeable number, because it can be changed into a prime (106627955557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1239859907 + ... + 1239859992.
It is an arithmetic number, because the mean of its divisors is an integer number (27276918900).
Almost surely, 2106627955657 is an apocalyptic number.
It is an amenable number.
106627955657 is a deficient number, since it is larger than the sum of its proper divisors (2479719943).
106627955657 is an equidigital number, since it uses as much as digits as its factorization.
106627955657 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2479719942.
The product of its (nonzero) digits is 23814000, while the sum is 59.
The spelling of 106627955657 in words is "one hundred six billion, six hundred twenty-seven million, nine hundred fifty-five thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •