Base | Representation |
---|---|
bin | 1100110000100… |
… | …00100011001101 |
3 | 21110101022022211 |
4 | 12120100203031 |
5 | 204344210131 |
6 | 14341510421 |
7 | 2436451033 |
oct | 630204315 |
9 | 243338284 |
10 | 107022541 |
11 | 5545868a |
12 | 2ba12411 |
13 | 19232062 |
14 | 102dc553 |
15 | 95e05b1 |
hex | 66108cd |
107022541 has 2 divisors, whose sum is σ = 107022542. Its totient is φ = 107022540.
The previous prime is 107022521. The next prime is 107022563. The reversal of 107022541 is 145220701.
It is a happy number.
It is an a-pointer prime, because the next prime (107022563) can be obtained adding 107022541 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 57320041 + 49702500 = 7571^2 + 7050^2 .
It is a cyclic number.
It is not a de Polignac number, because 107022541 - 29 = 107022029 is a prime.
It is a super-2 number, since 2×1070225412 = 22907648564193362, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107022511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53511270 + 53511271.
It is an arithmetic number, because the mean of its divisors is an integer number (53511271).
Almost surely, 2107022541 is an apocalyptic number.
It is an amenable number.
107022541 is a deficient number, since it is larger than the sum of its proper divisors (1).
107022541 is an equidigital number, since it uses as much as digits as its factorization.
107022541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 107022541 is about 10345.1699357720. The cubic root of 107022541 is about 474.7792747335.
The spelling of 107022541 in words is "one hundred seven million, twenty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •