Base | Representation |
---|---|
bin | 110001011011110110… |
… | …1110001110010110111 |
3 | 101011000120111020022001 |
4 | 1202313231301302313 |
5 | 3214404312233241 |
6 | 120434144120131 |
7 | 10445531255062 |
oct | 1426755616267 |
9 | 334016436261 |
10 | 106161446071 |
11 | 4102840679a |
12 | 186a9306047 |
13 | a01b184215 |
14 | 51d14978d9 |
15 | 2b65113431 |
hex | 18b7b71cb7 |
106161446071 has 2 divisors, whose sum is σ = 106161446072. Its totient is φ = 106161446070.
The previous prime is 106161446023. The next prime is 106161446107. The reversal of 106161446071 is 170644161601.
It is a happy number.
Together with next prime (106161446107) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 106161446071 - 223 = 106153057463 is a prime.
It is a super-2 number, since 2×1061614460712 (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 106161446071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106161446971) 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, 53080723035 + 53080723036.
It is an arithmetic number, because the mean of its divisors is an integer number (53080723036).
Almost surely, 2106161446071 is an apocalyptic number.
106161446071 is a deficient number, since it is larger than the sum of its proper divisors (1).
106161446071 is an equidigital number, since it uses as much as digits as its factorization.
106161446071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 37.
The spelling of 106161446071 in words is "one hundred six billion, one hundred sixty-one million, four hundred forty-six thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •