Base | Representation |
---|---|
bin | 110011010100100111… |
… | …0111011011111101101 |
3 | 101112110222001010201011 |
4 | 1212221032323133231 |
5 | 3301204120224423 |
6 | 122344212345221 |
7 | 10651122554605 |
oct | 1465116733755 |
9 | 345428033634 |
10 | 110213445613 |
11 | 42817686a47 |
12 | 1943a315211 |
13 | a5157b119b |
14 | 54976a5c05 |
15 | 2d00c0ab0d |
hex | 19a93bb7ed |
110213445613 has 2 divisors, whose sum is σ = 110213445614. Its totient is φ = 110213445612.
The previous prime is 110213445607. The next prime is 110213445619. The reversal of 110213445613 is 316544312011.
It is a balanced prime because it is at equal distance from previous prime (110213445607) and next prime (110213445619).
It can be written as a sum of positive squares in only one way, i.e., 71352025924 + 38861419689 = 267118^2 + 197133^2 .
It is an emirp because it is prime and its reverse (316544312011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110213445613 - 225 = 110179891181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110213445619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55106722806 + 55106722807.
It is an arithmetic number, because the mean of its divisors is an integer number (55106722807).
Almost surely, 2110213445613 is an apocalyptic number.
It is an amenable number.
110213445613 is a deficient number, since it is larger than the sum of its proper divisors (1).
110213445613 is an equidigital number, since it uses as much as digits as its factorization.
110213445613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 110213445613 its reverse (316544312011), we get a palindrome (426757757624).
The spelling of 110213445613 in words is "one hundred ten billion, two hundred thirteen million, four hundred forty-five thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •