Base | Representation |
---|---|
bin | 10000000000101010001… |
… | …110111111110000110001 |
3 | 10220011212020102012010121 |
4 | 100000222032333300301 |
5 | 121011222332431113 |
6 | 2201233441130241 |
7 | 142326324261661 |
oct | 20005216776061 |
9 | 3804766365117 |
10 | 1100220202033 |
11 | 394667692047 |
12 | 159291629981 |
13 | 7c99a5b6934 |
14 | 3b3728281a1 |
15 | 1d944e9ae8d |
hex | 1002a3bfc31 |
1100220202033 has 2 divisors, whose sum is σ = 1100220202034. Its totient is φ = 1100220202032.
The previous prime is 1100220201943. The next prime is 1100220202051. The reversal of 1100220202033 is 3302020220011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 655181781489 + 445038420544 = 809433^2 + 667112^2 .
It is an emirp because it is prime and its reverse (3302020220011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1100220202033 - 225 = 1100186647601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100220201998 and 1100220202016.
It is not a weakly prime, because it can be changed into another prime (1100220202063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550110101016 + 550110101017.
It is an arithmetic number, because the mean of its divisors is an integer number (550110101017).
Almost surely, 21100220202033 is an apocalyptic number.
It is an amenable number.
1100220202033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100220202033 is an equidigital number, since it uses as much as digits as its factorization.
1100220202033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 1100220202033 its reverse (3302020220011), we get a palindrome (4402240422044).
The spelling of 1100220202033 in words is "one trillion, one hundred billion, two hundred twenty million, two hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •