Base | Representation |
---|---|
bin | 11000000010000001000001… |
… | …010000100110101010101011 |
3 | 111212020000121211002202120112 |
4 | 120002001001100212222223 |
5 | 102323122444410413231 |
6 | 1012442023533044535 |
7 | 31155653421525056 |
oct | 3002010120465253 |
9 | 455200554082515 |
10 | 105691650091691 |
11 | 30749639112664 |
12 | ba2b8bb92674b |
13 | 46c88ab7b07a1 |
14 | 1c1570894da9d |
15 | c34437ed192b |
hex | 602041426aab |
105691650091691 has 2 divisors, whose sum is σ = 105691650091692. Its totient is φ = 105691650091690.
The previous prime is 105691650091553. The next prime is 105691650091693. The reversal of 105691650091691 is 196190056196501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105691650091691 - 230 = 105690576349867 is a prime.
It is a super-2 number, since 2×1056916500916912 (a number of 29 digits) contains 22 as substring.
Together with 105691650091693, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 105691650091691.
It is not a weakly prime, because it can be changed into another prime (105691650091693) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52845825045845 + 52845825045846.
It is an arithmetic number, because the mean of its divisors is an integer number (52845825045846).
Almost surely, 2105691650091691 is an apocalyptic number.
105691650091691 is a deficient number, since it is larger than the sum of its proper divisors (1).
105691650091691 is an equidigital number, since it uses as much as digits as its factorization.
105691650091691 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3936600, while the sum is 59.
The spelling of 105691650091691 in words is "one hundred five trillion, six hundred ninety-one billion, six hundred fifty million, ninety-one thousand, six hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •