Base | Representation |
---|---|
bin | 10010111101100111011… |
… | …110000000011011011011 |
3 | 11121120120001021010200011 |
4 | 102331213132000123123 |
5 | 132322232404310021 |
6 | 2434350235222351 |
7 | 163101206553406 |
oct | 22754736003333 |
9 | 4546501233604 |
10 | 1303111010011 |
11 | 462712214048 |
12 | 1906752a79b7 |
13 | 95b627a8975 |
14 | 470dc80ad3d |
15 | 23d6c0e5de1 |
hex | 12f677806db |
1303111010011 has 2 divisors, whose sum is σ = 1303111010012. Its totient is φ = 1303111010010.
The previous prime is 1303111010009. The next prime is 1303111010063. The reversal of 1303111010011 is 1100101113031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1303111010011 - 21 = 1303111010009 is a prime.
Together with 1303111010009, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1303111009973 and 1303111010000.
It is not a weakly prime, because it can be changed into another prime (1303111010111) 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, 651555505005 + 651555505006.
It is an arithmetic number, because the mean of its divisors is an integer number (651555505006).
Almost surely, 21303111010011 is an apocalyptic number.
1303111010011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1303111010011 is an equidigital number, since it uses as much as digits as its factorization.
1303111010011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 1303111010011 its reverse (1100101113031), we get a palindrome (2403212123042).
The spelling of 1303111010011 in words is "one trillion, three hundred three billion, one hundred eleven million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •