Base | Representation |
---|---|
bin | 1010001100100001010000… |
… | …0011111001110101011111 |
3 | 1110200200111012022112110002 |
4 | 2203020110003321311133 |
5 | 2432131443002211312 |
6 | 35501521221004515 |
7 | 2234624144040056 |
oct | 243102403716537 |
9 | 43620435275402 |
10 | 11210201210207 |
11 | 363224637434a |
12 | 131074185373b |
13 | 63416b01c78c |
14 | 2aa8103d539d |
15 | 14690a4d44c2 |
hex | a32140f9d5f |
11210201210207 has 2 divisors, whose sum is σ = 11210201210208. Its totient is φ = 11210201210206.
The previous prime is 11210201210113. The next prime is 11210201210213. The reversal of 11210201210207 is 70201210201211.
It is a happy number.
11210201210207 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11210201210207 - 214 = 11210201193823 is a prime.
It is a super-2 number, since 2×112102012102072 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11210201210227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605100605103 + 5605100605104.
It is an arithmetic number, because the mean of its divisors is an integer number (5605100605104).
Almost surely, 211210201210207 is an apocalyptic number.
11210201210207 is a deficient number, since it is larger than the sum of its proper divisors (1).
11210201210207 is an equidigital number, since it uses as much as digits as its factorization.
11210201210207 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 11210201210207 its reverse (70201210201211), we get a palindrome (81411411411418).
The spelling of 11210201210207 in words is "eleven trillion, two hundred ten billion, two hundred one million, two hundred ten thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •