Base | Representation |
---|---|
bin | 11001000010001100100101… |
… | …001110001001110011100011 |
3 | 112102211122210102121010022112 |
4 | 121002030211032021303203 |
5 | 103412403110420201011 |
6 | 1030100113411025535 |
7 | 32122420644533123 |
oct | 3102144516116343 |
9 | 472748712533275 |
10 | 110102111100131 |
11 | 3209a0523a6047 |
12 | 1042263a29b2ab |
13 | 495877a287277 |
14 | 1d28d834dac83 |
15 | cae01de5858b |
hex | 642325389ce3 |
110102111100131 has 2 divisors, whose sum is σ = 110102111100132. Its totient is φ = 110102111100130.
The previous prime is 110102111100089. The next prime is 110102111100139. The reversal of 110102111100131 is 131001111201011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110102111100131 - 242 = 105704064589027 is a prime.
It is a super-2 number, since 2×1101021111001312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110102111100139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55051055550065 + 55051055550066.
It is an arithmetic number, because the mean of its divisors is an integer number (55051055550066).
Almost surely, 2110102111100131 is an apocalyptic number.
110102111100131 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102111100131 is an equidigital number, since it uses as much as digits as its factorization.
110102111100131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 14.
Adding to 110102111100131 its reverse (131001111201011), we get a palindrome (241103222301142).
The spelling of 110102111100131 in words is "one hundred ten trillion, one hundred two billion, one hundred eleven million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •