Base | Representation |
---|---|
bin | 11001000011101001100111… |
… | …001001001001001110101001 |
3 | 112110012012121221200121210001 |
4 | 121003221213021021032221 |
5 | 103421022144320043423 |
6 | 1030214033413223001 |
7 | 32132555216511256 |
oct | 3103514711111651 |
9 | 473165557617701 |
10 | 110202001331113 |
11 | 3212845187804a |
12 | 10439a77331a61 |
13 | 4965009112813 |
14 | 1d2db3bb4642d |
15 | cb191870dcad |
hex | 643a672493a9 |
110202001331113 has 2 divisors, whose sum is σ = 110202001331114. Its totient is φ = 110202001331112.
The previous prime is 110202001331111. The next prime is 110202001331153. The reversal of 110202001331113 is 311133100202011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77827631068009 + 32374370263104 = 8821997^2 + 5689848^2 .
It is a cyclic number.
It is not a de Polignac number, because 110202001331113 - 21 = 110202001331111 is a prime.
Together with 110202001331111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (110202001331111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55101000665556 + 55101000665557.
It is an arithmetic number, because the mean of its divisors is an integer number (55101000665557).
Almost surely, 2110202001331113 is an apocalyptic number.
It is an amenable number.
110202001331113 is a deficient number, since it is larger than the sum of its proper divisors (1).
110202001331113 is an equidigital number, since it uses as much as digits as its factorization.
110202001331113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 110202001331113 its reverse (311133100202011), we get a palindrome (421335101533124).
The spelling of 110202001331113 in words is "one hundred ten trillion, two hundred two billion, one million, three hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •