Base | Representation |
---|---|
bin | 10010110101011101… |
… | …11111001000010101 |
3 | 222002201220001021202 |
4 | 21122232333020111 |
5 | 131202210414422 |
6 | 4351231322245 |
7 | 505406202155 |
oct | 113256771025 |
9 | 28081801252 |
10 | 10112201237 |
11 | 431a08a506 |
12 | 1b62680385 |
13 | c52013738 |
14 | 6bd00c765 |
15 | 3e2b72b92 |
hex | 25abbf215 |
10112201237 has 2 divisors, whose sum is σ = 10112201238. Its totient is φ = 10112201236.
The previous prime is 10112201189. The next prime is 10112201249. The reversal of 10112201237 is 73210221101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9998800036 + 113401201 = 99994^2 + 10649^2 .
It is an emirp because it is prime and its reverse (73210221101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10112201237 - 210 = 10112200213 is a prime.
It is a super-2 number, since 2×101122012372 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10112201257) 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, 5056100618 + 5056100619.
It is an arithmetic number, because the mean of its divisors is an integer number (5056100619).
Almost surely, 210112201237 is an apocalyptic number.
It is an amenable number.
10112201237 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112201237 is an equidigital number, since it uses as much as digits as its factorization.
10112201237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 10112201237 its reverse (73210221101), we get a palindrome (83322422338).
The spelling of 10112201237 in words is "ten billion, one hundred twelve million, two hundred one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •