Base | Representation |
---|---|
bin | 110011010100100011… |
… | …0010111100000101111 |
3 | 101112110210211002202222 |
4 | 1212221012113200233 |
5 | 3301203031413241 |
6 | 122344052305555 |
7 | 10651064516006 |
oct | 1465106274057 |
9 | 345423732688 |
10 | 110211201071 |
11 | 42816393654 |
12 | 194396122bb |
13 | a5151a665a |
14 | 549727dc3d |
15 | 2d00915a4b |
hex | 19a919782f |
110211201071 has 2 divisors, whose sum is σ = 110211201072. Its totient is φ = 110211201070.
The previous prime is 110211201017. The next prime is 110211201109. The reversal of 110211201071 is 170102112011.
Together with previous prime (110211201017) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110211201071 - 26 = 110211201007 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110211201011) 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, 55105600535 + 55105600536.
It is an arithmetic number, because the mean of its divisors is an integer number (55105600536).
Almost surely, 2110211201071 is an apocalyptic number.
110211201071 is a deficient number, since it is larger than the sum of its proper divisors (1).
110211201071 is an equidigital number, since it uses as much as digits as its factorization.
110211201071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 110211201071 its reverse (170102112011), we get a palindrome (280313313082).
The spelling of 110211201071 in words is "one hundred ten billion, two hundred eleven million, two hundred one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •