Base | Representation |
---|---|
bin | 10011000001010001… |
… | …01000010010110011 |
3 | 222100122011121111101 |
4 | 21200220220102303 |
5 | 131403031320011 |
6 | 4405125225231 |
7 | 511020515641 |
oct | 114050502263 |
9 | 28318147441 |
10 | 10211198131 |
11 | 436aa56322 |
12 | 1b8b862217 |
13 | c69695794 |
14 | 6cc21c191 |
15 | 3eb6ca2c1 |
hex | 260a284b3 |
10211198131 has 2 divisors, whose sum is σ = 10211198132. Its totient is φ = 10211198130.
The previous prime is 10211198117. The next prime is 10211198143. The reversal of 10211198131 is 13189111201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10211198131 - 229 = 9674327219 is a prime.
It is a super-2 number, since 2×102111981312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10211198131.
It is not a weakly prime, because it can be changed into another prime (10211198111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105599065 + 5105599066.
It is an arithmetic number, because the mean of its divisors is an integer number (5105599066).
Almost surely, 210211198131 is an apocalyptic number.
10211198131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211198131 is an equidigital number, since it uses as much as digits as its factorization.
10211198131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 28.
The spelling of 10211198131 in words is "ten billion, two hundred eleven million, one hundred ninety-eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •