Base | Representation |
---|---|
bin | 11001000100010000001010… |
… | …111101000110001100100011 |
3 | 112110100011111101202111110121 |
4 | 121010100022331012030203 |
5 | 103422211443002421201 |
6 | 1030245042031341111 |
7 | 32135552221345051 |
oct | 3104201275061443 |
9 | 473304441674417 |
10 | 110243404342051 |
11 | 32143a68790a62 |
12 | 10445ab1081797 |
13 | 4968ba6a59166 |
14 | 1d31b487ab1d1 |
15 | cb2a3d4829a1 |
hex | 64440af46323 |
110243404342051 has 2 divisors, whose sum is σ = 110243404342052. Its totient is φ = 110243404342050.
The previous prime is 110243404342037. The next prime is 110243404342061. The reversal of 110243404342051 is 150243404342011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110243404342051 - 219 = 110243403817763 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110243404341998 and 110243404342016.
It is not a weakly prime, because it can be changed into another prime (110243404342061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55121702171025 + 55121702171026.
It is an arithmetic number, because the mean of its divisors is an integer number (55121702171026).
Almost surely, 2110243404342051 is an apocalyptic number.
110243404342051 is a deficient number, since it is larger than the sum of its proper divisors (1).
110243404342051 is an equidigital number, since it uses as much as digits as its factorization.
110243404342051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 110243404342051 its reverse (150243404342011), we get a palindrome (260486808684062).
The spelling of 110243404342051 in words is "one hundred ten trillion, two hundred forty-three billion, four hundred four million, three hundred forty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •