Base | Representation |
---|---|
bin | 110001101101101100… |
… | …1000111111101011101 |
3 | 101012120021210111212012 |
4 | 1203123121013331131 |
5 | 3222121030332423 |
6 | 121013405321005 |
7 | 10466420061113 |
oct | 1433331077535 |
9 | 335507714765 |
10 | 106760011613 |
11 | 41305274962 |
12 | 18835866165 |
13 | a0b5199c08 |
14 | 524ab89ab3 |
15 | 2b9c94b078 |
hex | 18db647f5d |
106760011613 has 2 divisors, whose sum is σ = 106760011614. Its totient is φ = 106760011612.
The previous prime is 106760011549. The next prime is 106760011637. The reversal of 106760011613 is 316110067601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106668866404 + 91145209 = 326602^2 + 9547^2 .
It is a cyclic number.
It is not a de Polignac number, because 106760011613 - 26 = 106760011549 is a prime.
It is a super-2 number, since 2×1067600116132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 106760011613.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106760011693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53380005806 + 53380005807.
It is an arithmetic number, because the mean of its divisors is an integer number (53380005807).
Almost surely, 2106760011613 is an apocalyptic number.
It is an amenable number.
106760011613 is a deficient number, since it is larger than the sum of its proper divisors (1).
106760011613 is an equidigital number, since it uses as much as digits as its factorization.
106760011613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 32.
The spelling of 106760011613 in words is "one hundred six billion, seven hundred sixty million, eleven thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •