Base | Representation |
---|---|
bin | 11001000001010011000001… |
… | …101011001000011110101011 |
3 | 112102121202021111121202112222 |
4 | 121001103001223020132223 |
5 | 103410400024211330011 |
6 | 1030011453213424255 |
7 | 32115102333165632 |
oct | 3101230153103653 |
9 | 472552244552488 |
10 | 110040311433131 |
11 | 3207591a071592 |
12 | 1041267179b08b |
13 | 49529aba25781 |
14 | 1d25d9da1a519 |
15 | cac603715ddb |
hex | 6414c1ac87ab |
110040311433131 has 2 divisors, whose sum is σ = 110040311433132. Its totient is φ = 110040311433130.
The previous prime is 110040311433127. The next prime is 110040311433137. The reversal of 110040311433131 is 131334113040011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110040311433131 - 22 = 110040311433127 is a prime.
It is a super-2 number, since 2×1100403114331312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110040311433131.
It is not a weakly prime, because it can be changed into another prime (110040311433137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55020155716565 + 55020155716566.
It is an arithmetic number, because the mean of its divisors is an integer number (55020155716566).
Almost surely, 2110040311433131 is an apocalyptic number.
110040311433131 is a deficient number, since it is larger than the sum of its proper divisors (1).
110040311433131 is an equidigital number, since it uses as much as digits as its factorization.
110040311433131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 110040311433131 its reverse (131334113040011), we get a palindrome (241374424473142).
The spelling of 110040311433131 in words is "one hundred ten trillion, forty billion, three hundred eleven million, four hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •