Base | Representation |
---|---|
bin | 10000001010111110110… |
… | …001100000001001000001 |
3 | 10221020110120011112022022 |
4 | 100022332301200021001 |
5 | 121201421331210423 |
6 | 2210305235051225 |
7 | 143201050633304 |
oct | 20127661401101 |
9 | 3836416145268 |
10 | 1111302210113 |
11 | 399334142807 |
12 | 15b464a40b15 |
13 | 80a454c5674 |
14 | 3bb04564b3b |
15 | 1dd92d38dc8 |
hex | 102bec60241 |
1111302210113 has 2 divisors, whose sum is σ = 1111302210114. Its totient is φ = 1111302210112.
The previous prime is 1111302210107. The next prime is 1111302210149. The reversal of 1111302210113 is 3110122031111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1099796858944 + 11505351169 = 1048712^2 + 107263^2 .
It is an emirp because it is prime and its reverse (3110122031111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1111302210113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1111302210091 and 1111302210100.
It is not a weakly prime, because it can be changed into another prime (1111302210163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555651105056 + 555651105057.
It is an arithmetic number, because the mean of its divisors is an integer number (555651105057).
Almost surely, 21111302210113 is an apocalyptic number.
It is an amenable number.
1111302210113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111302210113 is an equidigital number, since it uses as much as digits as its factorization.
1111302210113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1111302210113 its reverse (3110122031111), we get a palindrome (4221424241224).
The spelling of 1111302210113 in words is "one trillion, one hundred eleven billion, three hundred two million, two hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •