Base | Representation |
---|---|
bin | 11001000000101111011101… |
… | …011010011101101100100011 |
3 | 112102111002201000200122110001 |
4 | 121000233131122131230203 |
5 | 103404233321230314341 |
6 | 1025542135520120431 |
7 | 32112251063322334 |
oct | 3100573532355443 |
9 | 472432630618401 |
10 | 110002122119971 |
11 | 32060702207354 |
12 | 10407194166117 |
13 | 494c203b35653 |
14 | 1d241b9b0828b |
15 | cab61ab98d31 |
hex | 640bdd69db23 |
110002122119971 has 2 divisors, whose sum is σ = 110002122119972. Its totient is φ = 110002122119970.
The previous prime is 110002122119921. The next prime is 110002122120031. The reversal of 110002122119971 is 179911221200011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110002122119971 - 213 = 110002122111779 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110002122119971.
It is not a weakly prime, because it can be changed into another prime (110002122119921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55001061059985 + 55001061059986.
It is an arithmetic number, because the mean of its divisors is an integer number (55001061059986).
Almost surely, 2110002122119971 is an apocalyptic number.
110002122119971 is a deficient number, since it is larger than the sum of its proper divisors (1).
110002122119971 is an equidigital number, since it uses as much as digits as its factorization.
110002122119971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 37.
Adding to 110002122119971 its reverse (179911221200011), we get a palindrome (289913343319982).
The spelling of 110002122119971 in words is "one hundred ten trillion, two billion, one hundred twenty-two million, one hundred nineteen thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •