Base | Representation |
---|---|
bin | 1101001011000… |
… | …11000110001101 |
3 | 21200221022020221 |
4 | 12211203012031 |
5 | 211242201011 |
6 | 14544311341 |
7 | 2511201016 |
oct | 645430615 |
9 | 250838227 |
10 | 110506381 |
11 | 57418097 |
12 | 31012551 |
13 | 19b819bb |
14 | 1096800d |
15 | 9a7c971 |
hex | 696318d |
110506381 has 2 divisors, whose sum is σ = 110506382. Its totient is φ = 110506380.
The previous prime is 110506379. The next prime is 110506387. The reversal of 110506381 is 183605011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109620900 + 885481 = 10470^2 + 941^2 .
It is a cyclic number.
It is not a de Polignac number, because 110506381 - 21 = 110506379 is a prime.
It is a super-2 number, since 2×1105063812 = 24423320483434322, which contains 22 as substring.
Together with 110506379, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110506387) 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, 55253190 + 55253191.
It is an arithmetic number, because the mean of its divisors is an integer number (55253191).
Almost surely, 2110506381 is an apocalyptic number.
110506381 is the 6649-th centered pentagonal number.
It is an amenable number.
110506381 is a deficient number, since it is larger than the sum of its proper divisors (1).
110506381 is an equidigital number, since it uses as much as digits as its factorization.
110506381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 25.
The square root of 110506381 is about 10512.2015296512. The cubic root of 110506381 is about 479.8760979390.
The spelling of 110506381 in words is "one hundred ten million, five hundred six thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •