Base | Representation |
---|---|
bin | 100000001011101110… |
… | …1100101111011000011 |
3 | 20121101121111202210122 |
4 | 1000113131211323003 |
5 | 2113020424011321 |
6 | 51430005450455 |
7 | 4664454513065 |
oct | 1002735457303 |
9 | 217347452718 |
10 | 69113110211 |
11 | 27346604702 |
12 | 11489a10a2b |
13 | 66957913b2 |
14 | 34b8d0d735 |
15 | 1be78238ab |
hex | 1017765ec3 |
69113110211 has 2 divisors, whose sum is σ = 69113110212. Its totient is φ = 69113110210.
The previous prime is 69113110163. The next prime is 69113110237. The reversal of 69113110211 is 11201131196.
It is an a-pointer prime, because the next prime (69113110237) can be obtained adding 69113110211 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 69113110211 - 222 = 69108915907 is a prime.
It is not a weakly prime, because it can be changed into another prime (69113119211) 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, 34556555105 + 34556555106.
It is an arithmetic number, because the mean of its divisors is an integer number (34556555106).
Almost surely, 269113110211 is an apocalyptic number.
69113110211 is a deficient number, since it is larger than the sum of its proper divisors (1).
69113110211 is an equidigital number, since it uses as much as digits as its factorization.
69113110211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 26.
The spelling of 69113110211 in words is "sixty-nine billion, one hundred thirteen million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •