Base | Representation |
---|---|
bin | 11001000011100111110000… |
… | …000110011110000010101111 |
3 | 112110012000110202121212022102 |
4 | 121003213300012132002233 |
5 | 103421004102030004411 |
6 | 1030213103310405315 |
7 | 32132454555622244 |
oct | 3103476006360257 |
9 | 473160422555272 |
10 | 110200004141231 |
11 | 3212761747a7a4 |
12 | 104395ba50083b |
13 | 4964a7b410564 |
14 | 1d2d9cc7bd5cb |
15 | cb184d203d3b |
hex | 6439f019e0af |
110200004141231 has 2 divisors, whose sum is σ = 110200004141232. Its totient is φ = 110200004141230.
The previous prime is 110200004141089. The next prime is 110200004141261. The reversal of 110200004141231 is 132141400002011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110200004141231 - 246 = 39831259963567 is a prime.
It is a super-2 number, since 2×1102000041412312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110200004141261) 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, 55100002070615 + 55100002070616.
It is an arithmetic number, because the mean of its divisors is an integer number (55100002070616).
Almost surely, 2110200004141231 is an apocalyptic number.
110200004141231 is a deficient number, since it is larger than the sum of its proper divisors (1).
110200004141231 is an equidigital number, since it uses as much as digits as its factorization.
110200004141231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 110200004141231 its reverse (132141400002011), we get a palindrome (242341404143242).
The spelling of 110200004141231 in words is "one hundred ten trillion, two hundred billion, four million, one hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •