Base | Representation |
---|---|
bin | 1101001001011… |
… | …10011001010001 |
3 | 21200112100010211 |
4 | 12210232121101 |
5 | 211213244023 |
6 | 14535524121 |
7 | 2506311454 |
oct | 644563121 |
9 | 250470124 |
10 | 110290513 |
11 | 5728a993 |
12 | 30b29641 |
13 | 19b07678 |
14 | 1090d49b |
15 | 9a38a0d |
hex | 692e651 |
110290513 has 2 divisors, whose sum is σ = 110290514. Its totient is φ = 110290512.
The previous prime is 110290511. The next prime is 110290519. The reversal of 110290513 is 315092011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72982849 + 37307664 = 8543^2 + 6108^2 .
It is a cyclic number.
It is not a de Polignac number, because 110290513 - 21 = 110290511 is a prime.
Together with 110290511, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (110290511) 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, 55145256 + 55145257.
It is an arithmetic number, because the mean of its divisors is an integer number (55145257).
Almost surely, 2110290513 is an apocalyptic number.
It is an amenable number.
110290513 is a deficient number, since it is larger than the sum of its proper divisors (1).
110290513 is an equidigital number, since it uses as much as digits as its factorization.
110290513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 22.
The square root of 110290513 is about 10501.9290132813. The cubic root of 110290513 is about 479.5634239310.
The spelling of 110290513 in words is "one hundred ten million, two hundred ninety thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •