Base | Representation |
---|---|
bin | 10011000001001111… |
… | …11010110110010111 |
3 | 222100121211011011022 |
4 | 21200213322312113 |
5 | 131403004340431 |
6 | 4405121231355 |
7 | 511016112155 |
oct | 114047726627 |
9 | 28317734138 |
10 | 10211011991 |
11 | 436a939494 |
12 | 1b8b79255b |
13 | c6962bb3b |
14 | 6cc1b03d5 |
15 | 3eb69007b |
hex | 2609fad97 |
10211011991 has 2 divisors, whose sum is σ = 10211011992. Its totient is φ = 10211011990.
The previous prime is 10211011949. The next prime is 10211011997. The reversal of 10211011991 is 19911011201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10211011991 - 26 = 10211011927 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10211011991.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10211011997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105505995 + 5105505996.
It is an arithmetic number, because the mean of its divisors is an integer number (5105505996).
Almost surely, 210211011991 is an apocalyptic number.
10211011991 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211011991 is an equidigital number, since it uses as much as digits as its factorization.
10211011991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 26.
The spelling of 10211011991 in words is "ten billion, two hundred eleven million, eleven thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •