Base | Representation |
---|---|
bin | 1100100001010… |
… | …00001010110101 |
3 | 21022121200021122 |
4 | 12100220022311 |
5 | 203341202013 |
6 | 14230553325 |
7 | 2413446656 |
oct | 620501265 |
9 | 238550248 |
10 | 105022133 |
11 | 54311757 |
12 | 2b208845 |
13 | 189b1698 |
14 | dd3b52d |
15 | 9347a08 |
hex | 64282b5 |
105022133 has 2 divisors, whose sum is σ = 105022134. Its totient is φ = 105022132.
The previous prime is 105022129. The next prime is 105022157. The reversal of 105022133 is 331220501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102070609 + 2951524 = 10103^2 + 1718^2 .
It is a cyclic number.
It is not a de Polignac number, because 105022133 - 22 = 105022129 is a prime.
It is a super-2 number, since 2×1050221332 = 22059296839739378, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105022103) 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, 52511066 + 52511067.
It is an arithmetic number, because the mean of its divisors is an integer number (52511067).
Almost surely, 2105022133 is an apocalyptic number.
It is an amenable number.
105022133 is a deficient number, since it is larger than the sum of its proper divisors (1).
105022133 is an equidigital number, since it uses as much as digits as its factorization.
105022133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 105022133 is about 10248.0306888690. The cubic root of 105022133 is about 471.8025438682.
Adding to 105022133 its reverse (331220501), we get a palindrome (436242634).
The spelling of 105022133 in words is "one hundred five million, twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •