Base | Representation |
---|---|
bin | 10000000010010110010… |
… | …011000111111000110101 |
3 | 10220100112120221012122111 |
4 | 100002112103013320311 |
5 | 121023431001120341 |
6 | 2202133404331021 |
7 | 142422260561020 |
oct | 20022623077065 |
9 | 3810476835574 |
10 | 1102033223221 |
11 | 39540802a767 |
12 | 1596b8843a71 |
13 | 7cbc90b5738 |
14 | 3b4a55301b7 |
15 | 1d9ee227681 |
hex | 100964c7e35 |
1102033223221 has 16 divisors (see below), whose sum is σ = 1286843587200. Its totient is φ = 924256365120.
The previous prime is 1102033223219. The next prime is 1102033223227. The reversal of 1102033223221 is 1223223302011.
It is a cyclic number.
It is not a de Polignac number, because 1102033223221 - 21 = 1102033223219 is a prime.
It is a super-2 number, since 2×11020332232212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102033223192 and 1102033223201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102033223227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7815190 + ... + 7954951.
It is an arithmetic number, because the mean of its divisors is an integer number (80427724200).
Almost surely, 21102033223221 is an apocalyptic number.
It is an amenable number.
1102033223221 is a deficient number, since it is larger than the sum of its proper divisors (184810363979).
1102033223221 is a wasteful number, since it uses less digits than its factorization.
1102033223221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15770364.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 1102033223221 its reverse (1223223302011), we get a palindrome (2325256525232).
The spelling of 1102033223221 in words is "one trillion, one hundred two billion, thirty-three million, two hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •