Base | Representation |
---|---|
bin | 10100111000010101… |
… | …10000101010000111 |
3 | 1001221020121001111101 |
4 | 22130022300222013 |
5 | 140424230013111 |
6 | 5052205120531 |
7 | 544536302515 |
oct | 123412605207 |
9 | 31836531441 |
10 | 11210001031 |
11 | 4832831769 |
12 | 220a259147 |
13 | 10985a3b08 |
14 | 784b374b5 |
15 | 459221bc1 |
hex | 29c2b0a87 |
11210001031 has 2 divisors, whose sum is σ = 11210001032. Its totient is φ = 11210001030.
The previous prime is 11210000993. The next prime is 11210001041. The reversal of 11210001031 is 13010001211.
It is an a-pointer prime, because the next prime (11210001041) can be obtained adding 11210001031 to its sum of digits (10).
It is a strong prime.
It is an emirp because it is prime and its reverse (13010001211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11210001031 - 223 = 11201612423 is a prime.
It is a super-2 number, since 2×112100010312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11210000999 and 11210001017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11210001041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605000515 + 5605000516.
It is an arithmetic number, because the mean of its divisors is an integer number (5605000516).
Almost surely, 211210001031 is an apocalyptic number.
11210001031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11210001031 is an equidigital number, since it uses as much as digits as its factorization.
11210001031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 11210001031 its reverse (13010001211), we get a palindrome (24220002242).
The spelling of 11210001031 in words is "eleven billion, two hundred ten million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •