Base | Representation |
---|---|
bin | 10011000001011111… |
… | …11110000010001011 |
3 | 222100202210100210201 |
4 | 21200233332002023 |
5 | 131404024402222 |
6 | 4405234353031 |
7 | 511043051302 |
oct | 114057760213 |
9 | 28322710721 |
10 | 10213122187 |
11 | 437104a954 |
12 | 1b9042b777 |
13 | c69bba488 |
14 | 6cc59d439 |
15 | 3eb95a427 |
hex | 260bfe08b |
10213122187 has 2 divisors, whose sum is σ = 10213122188. Its totient is φ = 10213122186.
The previous prime is 10213122163. The next prime is 10213122203. The reversal of 10213122187 is 78122131201.
10213122187 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 an emirp because it is prime and its reverse (78122131201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10213122187 is a prime.
It is a super-3 number, since 3×102131221873 (a number of 31 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (10213122107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106561093 + 5106561094.
It is an arithmetic number, because the mean of its divisors is an integer number (5106561094).
Almost surely, 210213122187 is an apocalyptic number.
10213122187 is a deficient number, since it is larger than the sum of its proper divisors (1).
10213122187 is an equidigital number, since it uses as much as digits as its factorization.
10213122187 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 28.
Adding to 10213122187 its reverse (78122131201), we get a palindrome (88335253388).
The spelling of 10213122187 in words is "ten billion, two hundred thirteen million, one hundred twenty-two thousand, one hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •