Base | Representation |
---|---|
bin | 10000000010010101100… |
… | …001100010000011110101 |
3 | 10220100111200110202000000 |
4 | 100002111201202003311 |
5 | 121023414134120341 |
6 | 2202132221541513 |
7 | 142422042225111 |
oct | 20022541420365 |
9 | 3810450422000 |
10 | 1102020223221 |
11 | 395400760665 |
12 | 1596b4414899 |
13 | 7cbc64b3528 |
14 | 3b4a3908741 |
15 | 1d9ed00a8b6 |
hex | 100958620f5 |
1102020223221 has 56 divisors (see below), whose sum is σ = 1770546677760. Its totient is φ = 683132144256.
The previous prime is 1102020223217. The next prime is 1102020223243. The reversal of 1102020223221 is 1223220202011.
It is not a de Polignac number, because 1102020223221 - 22 = 1102020223217 is a prime.
It is a super-2 number, since 2×11020202232212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1102020223194 and 1102020223203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102020223021) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 492940 + ... + 1564298.
It is an arithmetic number, because the mean of its divisors is an integer number (31616904960).
Almost surely, 21102020223221 is an apocalyptic number.
It is an amenable number.
1102020223221 is a deficient number, since it is larger than the sum of its proper divisors (668526454539).
1102020223221 is an equidigital number, since it uses as much as digits as its factorization.
1102020223221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1071477 (or 1071462 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 1102020223221 its reverse (1223220202011), we get a palindrome (2325240425232).
The spelling of 1102020223221 in words is "one trillion, one hundred two billion, twenty million, two hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •