Base | Representation |
---|---|
bin | 10010110101001111… |
… | …10100010111010101 |
3 | 222002121100120122022 |
4 | 21122213310113111 |
5 | 131201220302013 |
6 | 4351123142525 |
7 | 505354214552 |
oct | 113247642725 |
9 | 28077316568 |
10 | 10110322133 |
11 | 431901672a |
12 | 1b61b14a45 |
13 | c51806342 |
14 | 6bca7da29 |
15 | 3e2901008 |
hex | 25a9f45d5 |
10110322133 has 2 divisors, whose sum is σ = 10110322134. Its totient is φ = 10110322132.
The previous prime is 10110322109. The next prime is 10110322163. The reversal of 10110322133 is 33122301101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5494070884 + 4616251249 = 74122^2 + 67943^2 .
It is a cyclic number.
It is not a de Polignac number, because 10110322133 - 226 = 10043213269 is a prime.
It is a super-2 number, since 2×101103221332 (a number of 21 digits) 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 (10110322163) 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, 5055161066 + 5055161067.
It is an arithmetic number, because the mean of its divisors is an integer number (5055161067).
Almost surely, 210110322133 is an apocalyptic number.
It is an amenable number.
10110322133 is a deficient number, since it is larger than the sum of its proper divisors (1).
10110322133 is an equidigital number, since it uses as much as digits as its factorization.
10110322133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10110322133 its reverse (33122301101), we get a palindrome (43232623234).
The spelling of 10110322133 in words is "ten billion, one hundred ten million, three hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •