Base | Representation |
---|---|
bin | 110001110011001001… |
… | …1000111101101110001 |
3 | 101020001001002122001212 |
4 | 1203212103013231301 |
5 | 3223004401041441 |
6 | 121043503205505 |
7 | 10504101251315 |
oct | 1434623075561 |
9 | 336031078055 |
10 | 106942987121 |
11 | 4139958a093 |
12 | 18886ba6895 |
13 | a114073249 |
14 | 52671b9b45 |
15 | 2bada40eeb |
hex | 18e64c7b71 |
106942987121 has 2 divisors, whose sum is σ = 106942987122. Its totient is φ = 106942987120.
The previous prime is 106942987117. The next prime is 106942987127. The reversal of 106942987121 is 121789249601.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106382954896 + 560032225 = 326164^2 + 23665^2 .
It is a cyclic number.
It is not a de Polignac number, because 106942987121 - 22 = 106942987117 is a prime.
It is a super-2 number, since 2×1069429871212 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 106942987121.
It is not a weakly prime, because it can be changed into another prime (106942987127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53471493560 + 53471493561.
It is an arithmetic number, because the mean of its divisors is an integer number (53471493561).
Almost surely, 2106942987121 is an apocalyptic number.
It is an amenable number.
106942987121 is a deficient number, since it is larger than the sum of its proper divisors (1).
106942987121 is an equidigital number, since it uses as much as digits as its factorization.
106942987121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 435456, while the sum is 50.
The spelling of 106942987121 in words is "one hundred six billion, nine hundred forty-two million, nine hundred eighty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •