Base | Representation |
---|---|
bin | 110001110001010011… |
… | …1000011110010011101 |
3 | 101012212201122200211102 |
4 | 1203202213003302131 |
5 | 3222343030330203 |
6 | 121033413002445 |
7 | 10502420255162 |
oct | 1434247036235 |
9 | 335781580742 |
10 | 106881105053 |
11 | 41367663188 |
12 | 1886a323425 |
13 | a1042b7738 |
14 | 525ccac069 |
15 | 2ba83ba888 |
hex | 18e29c3c9d |
106881105053 has 2 divisors, whose sum is σ = 106881105054. Its totient is φ = 106881105052.
The previous prime is 106881104971. The next prime is 106881105109. The reversal of 106881105053 is 350501188601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 82055321209 + 24825783844 = 286453^2 + 157562^2 .
It is a cyclic number.
It is not a de Polignac number, because 106881105053 - 214 = 106881088669 is a prime.
It is a super-2 number, since 2×1068811050532 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106881104998 and 106881105016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106881605053) 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, 53440552526 + 53440552527.
It is an arithmetic number, because the mean of its divisors is an integer number (53440552527).
Almost surely, 2106881105053 is an apocalyptic number.
It is an amenable number.
106881105053 is a deficient number, since it is larger than the sum of its proper divisors (1).
106881105053 is an equidigital number, since it uses as much as digits as its factorization.
106881105053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 38.
The spelling of 106881105053 in words is "one hundred six billion, eight hundred eighty-one million, one hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •