Base | Representation |
---|---|
bin | 10000000000011110011… |
… | …010111011011001110001 |
3 | 10220011100102110122121021 |
4 | 100000132122323121301 |
5 | 121010321113101223 |
6 | 2201202041055441 |
7 | 142321366516102 |
oct | 20003632733161 |
9 | 3804312418537 |
10 | 1100022003313 |
11 | 39457581a452 |
12 | 159237187581 |
13 | 7c96851049c |
14 | 3b3543943a9 |
15 | 1d93289a65d |
hex | 1001e6bb671 |
1100022003313 has 2 divisors, whose sum is σ = 1100022003314. Its totient is φ = 1100022003312.
The previous prime is 1100022003307. The next prime is 1100022003317. The reversal of 1100022003313 is 3133002200011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1085572280464 + 14449722849 = 1041908^2 + 120207^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100022003313 - 29 = 1100022002801 is a prime.
It is not a weakly prime, because it can be changed into another prime (1100022003317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550011001656 + 550011001657.
It is an arithmetic number, because the mean of its divisors is an integer number (550011001657).
Almost surely, 21100022003313 is an apocalyptic number.
It is an amenable number.
1100022003313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100022003313 is an equidigital number, since it uses as much as digits as its factorization.
1100022003313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1100022003313 its reverse (3133002200011), we get a palindrome (4233024203324).
The spelling of 1100022003313 in words is "one trillion, one hundred billion, twenty-two million, three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •