Base | Representation |
---|---|
bin | 110011010001100111… |
… | …1111000011011111101 |
3 | 101112012222002121000222 |
4 | 1212203033320123331 |
5 | 3301002414010213 |
6 | 122330224231125 |
7 | 10645463220422 |
oct | 1464317703375 |
9 | 345188077028 |
10 | 110113031933 |
11 | 42775a32733 |
12 | 1941076b4a5 |
13 | a4caa542c8 |
14 | 5488207d49 |
15 | 2ce6ec3808 |
hex | 19a33f86fd |
110113031933 has 2 divisors, whose sum is σ = 110113031934. Its totient is φ = 110113031932.
The previous prime is 110113031909. The next prime is 110113031957. The reversal of 110113031933 is 339130311011.
It is a balanced prime because it is at equal distance from previous prime (110113031909) and next prime (110113031957).
It can be written as a sum of positive squares in only one way, i.e., 69083288569 + 41029743364 = 262837^2 + 202558^2 .
It is a cyclic number.
It is not a de Polignac number, because 110113031933 - 212 = 110113027837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110113031993) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056515966 + 55056515967.
It is an arithmetic number, because the mean of its divisors is an integer number (55056515967).
Almost surely, 2110113031933 is an apocalyptic number.
It is an amenable number.
110113031933 is a deficient number, since it is larger than the sum of its proper divisors (1).
110113031933 is an equidigital number, since it uses as much as digits as its factorization.
110113031933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 729, while the sum is 26.
Adding to 110113031933 its reverse (339130311011), we get a palindrome (449243342944).
The spelling of 110113031933 in words is "one hundred ten billion, one hundred thirteen million, thirty-one thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •