Base | Representation |
---|---|
bin | 1101001011000… |
… | …10110000110011 |
3 | 21200221020101012 |
4 | 12211202300303 |
5 | 211242130021 |
6 | 14544301135 |
7 | 2511164021 |
oct | 645426063 |
9 | 250836335 |
10 | 110505011 |
11 | 57417061 |
12 | 310117ab |
13 | 19b811a6 |
14 | 10967711 |
15 | 9a7c35b |
hex | 6962c33 |
110505011 has 2 divisors, whose sum is σ = 110505012. Its totient is φ = 110505010.
The previous prime is 110504873. The next prime is 110505013.
110505011 is nontrivially palindromic in base 10.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110505011 is a prime.
It is a super-2 number, since 2×1105050112 = 24422714912220242, which contains 22 as substring.
Together with 110505013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (110505013) 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, 55252505 + 55252506.
It is an arithmetic number, because the mean of its divisors is an integer number (55252506).
Almost surely, 2110505011 is an apocalyptic number.
110505011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110505011 is an equidigital number, since it uses as much as digits as its factorization.
110505011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25, while the sum is 14.
The square root of 110505011 is about 10512.1363670759. The cubic root of 110505011 is about 479.8741148469.
It can be divided in two parts, 11050 and 5011, that added together give a palindrome (16061).
The spelling of 110505011 in words is "one hundred ten million, five hundred five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •