Base | Representation |
---|---|
bin | 11101011001010010101… |
… | …10100111101011100001 |
3 | 10120120000102002111211002 |
4 | 32230221112213223201 |
5 | 113022000321010423 |
6 | 2051554231201345 |
7 | 132654005532665 |
oct | 16545126475341 |
9 | 3516012074732 |
10 | 1010011110113 |
11 | 35a385a39115 |
12 | 1438b6816255 |
13 | 74322375c35 |
14 | 36c55c5c8a5 |
15 | 1b4155bb228 |
hex | eb295a7ae1 |
1010011110113 has 2 divisors, whose sum is σ = 1010011110114. Its totient is φ = 1010011110112.
The previous prime is 1010011110107. The next prime is 1010011110133. The reversal of 1010011110113 is 3110111100101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 510857556049 + 499153554064 = 714743^2 + 706508^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010011110113 - 226 = 1009944001249 is a prime.
It is a super-2 number, since 2×10100111101132 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010011110094 and 1010011110103.
It is not a weakly prime, because it can be changed into another prime (1010011110133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505005555056 + 505005555057.
It is an arithmetic number, because the mean of its divisors is an integer number (505005555057).
Almost surely, 21010011110113 is an apocalyptic number.
It is an amenable number.
1010011110113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010011110113 is an equidigital number, since it uses as much as digits as its factorization.
1010011110113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 1010011110113 its reverse (3110111100101), we get a palindrome (4120122210214).
The spelling of 1010011110113 in words is "one trillion, ten billion, eleven million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •