Base | Representation |
---|---|
bin | 11101011011110000000… |
… | …01111111000110111001 |
3 | 10120200102101220000001122 |
4 | 32231320001333012321 |
5 | 113032201230213423 |
6 | 2052333223155025 |
7 | 133031504344154 |
oct | 16557001770671 |
9 | 3520371800048 |
10 | 1011331101113 |
11 | 35a9a304a973 |
12 | 1440048a5a75 |
13 | 744a29901b8 |
14 | 36d3d2a4c9b |
15 | 1b4914098c8 |
hex | eb7807f1b9 |
1011331101113 has 2 divisors, whose sum is σ = 1011331101114. Its totient is φ = 1011331101112.
The previous prime is 1011331101083. The next prime is 1011331101133. The reversal of 1011331101113 is 3111011331101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 647851131664 + 363479969449 = 804892^2 + 602893^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011331101113 - 210 = 1011331100089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1011331101091 and 1011331101100.
It is not a weakly prime, because it can be changed into another prime (1011331101133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505665550556 + 505665550557.
It is an arithmetic number, because the mean of its divisors is an integer number (505665550557).
Almost surely, 21011331101113 is an apocalyptic number.
It is an amenable number.
1011331101113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011331101113 is an equidigital number, since it uses as much as digits as its factorization.
1011331101113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 1011331101113 its reverse (3111011331101), we get a palindrome (4122342432214).
The spelling of 1011331101113 in words is "one trillion, eleven billion, three hundred thirty-one million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •