Base | Representation |
---|---|
bin | 110001100111111101… |
… | …1100101011000000001 |
3 | 101012001212222000011101 |
4 | 1203033323211120001 |
5 | 3221222313442101 |
6 | 120542340014401 |
7 | 10461563442364 |
oct | 1431773453001 |
9 | 335055860141 |
10 | 106567718401 |
11 | 41216776151 |
12 | 187a1391401 |
13 | a0843b0751 |
14 | 522d4120db |
15 | 2b8ab15401 |
hex | 18cfee5601 |
106567718401 has 2 divisors, whose sum is σ = 106567718402. Its totient is φ = 106567718400.
The previous prime is 106567718399. The next prime is 106567718437. The reversal of 106567718401 is 104817765601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 63378566001 + 43189152400 = 251751^2 + 207820^2 .
It is a cyclic number.
It is not a de Polignac number, because 106567718401 - 21 = 106567718399 is a prime.
It is a super-3 number, since 3×1065677184013 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 106567718399, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (106567718501) 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, 53283859200 + 53283859201.
It is an arithmetic number, because the mean of its divisors is an integer number (53283859201).
Almost surely, 2106567718401 is an apocalyptic number.
It is an amenable number.
106567718401 is a deficient number, since it is larger than the sum of its proper divisors (1).
106567718401 is an equidigital number, since it uses as much as digits as its factorization.
106567718401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 282240, while the sum is 46.
The spelling of 106567718401 in words is "one hundred six billion, five hundred sixty-seven million, seven hundred eighteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •