Base | Representation |
---|---|
bin | 10011110000010001… |
… | …111000100011101011 |
3 | 2000202020101222012202 |
4 | 103300101320203223 |
5 | 321420014323011 |
6 | 13424431130415 |
7 | 1350426166001 |
oct | 236021704353 |
9 | 60666358182 |
10 | 21211089131 |
11 | 8aa511a231 |
12 | 413b673a0b |
13 | 200058261b |
14 | 10530a0a71 |
15 | 84224723b |
hex | 4f04788eb |
21211089131 has 2 divisors, whose sum is σ = 21211089132. Its totient is φ = 21211089130.
The previous prime is 21211089113. The next prime is 21211089161. The reversal of 21211089131 is 13198011212.
It is a happy number.
Together with previous prime (21211089113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21211089131 - 222 = 21206894827 is a prime.
It is a super-2 number, since 2×212110891312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 21211089094 and 21211089103.
It is not a weakly prime, because it can be changed into another prime (21211089161) 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, 10605544565 + 10605544566.
It is an arithmetic number, because the mean of its divisors is an integer number (10605544566).
Almost surely, 221211089131 is an apocalyptic number.
21211089131 is a deficient number, since it is larger than the sum of its proper divisors (1).
21211089131 is an equidigital number, since it uses as much as digits as its factorization.
21211089131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 29.
The spelling of 21211089131 in words is "twenty-one billion, two hundred eleven million, eighty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •