Base | Representation |
---|---|
bin | 11001001111100100011101… |
… | …110101001000000000101101 |
3 | 112120002111220001100101210011 |
4 | 121033210131311020000231 |
5 | 104022432213141200023 |
6 | 1032042221025013221 |
7 | 32246003414252641 |
oct | 3117443565100055 |
9 | 476074801311704 |
10 | 111021110100013 |
11 | 32413874378733 |
12 | 10550775184211 |
13 | 49c4326c20829 |
14 | 1d5b643c7ac21 |
15 | cc7da93c350d |
hex | 64f91dd4802d |
111021110100013 has 2 divisors, whose sum is σ = 111021110100014. Its totient is φ = 111021110100012.
The previous prime is 111021110100001. The next prime is 111021110100067. The reversal of 111021110100013 is 310001011120111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80540088694569 + 30481021405444 = 8974413^2 + 5520962^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111021110100013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111021110099966 and 111021110100002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111021110100413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510555050006 + 55510555050007.
It is an arithmetic number, because the mean of its divisors is an integer number (55510555050007).
Almost surely, 2111021110100013 is an apocalyptic number.
It is an amenable number.
111021110100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
111021110100013 is an equidigital number, since it uses as much as digits as its factorization.
111021110100013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 111021110100013 its reverse (310001011120111), we get a palindrome (421022121220124).
The spelling of 111021110100013 in words is "one hundred eleven trillion, twenty-one billion, one hundred ten million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •