Base | Representation |
---|---|
bin | 110011010111010000… |
… | …1001101000010000001 |
3 | 101112201010220100222222 |
4 | 1212232201031002001 |
5 | 3301344320401423 |
6 | 122401101140425 |
7 | 10653250365641 |
oct | 1465641150201 |
9 | 345633810888 |
10 | 110302122113 |
11 | 42862743a07 |
12 | 19463b5a715 |
13 | a52ac8b8a1 |
14 | 54a538a521 |
15 | 2d088c53c8 |
hex | 19ae84d081 |
110302122113 has 2 divisors, whose sum is σ = 110302122114. Its totient is φ = 110302122112.
The previous prime is 110302122071. The next prime is 110302122149. The reversal of 110302122113 is 311221203011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79833372304 + 30468749809 = 282548^2 + 174553^2 .
It is a cyclic number.
It is not a de Polignac number, because 110302122113 - 28 = 110302121857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110302122091 and 110302122100.
It is not a weakly prime, because it can be changed into another prime (110302122013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55151061056 + 55151061057.
It is an arithmetic number, because the mean of its divisors is an integer number (55151061057).
Almost surely, 2110302122113 is an apocalyptic number.
It is an amenable number.
110302122113 is a deficient number, since it is larger than the sum of its proper divisors (1).
110302122113 is an equidigital number, since it uses as much as digits as its factorization.
110302122113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 110302122113 its reverse (311221203011), we get a palindrome (421523325124).
The spelling of 110302122113 in words is "one hundred ten billion, three hundred two million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •