Base | Representation |
---|---|
bin | 10000000010011011100… |
… | …110001111100000000101 |
3 | 10220100202210012200210000 |
4 | 100002123212033200011 |
5 | 121024121230334341 |
6 | 2202150301551513 |
7 | 142424420313612 |
oct | 20023346174005 |
9 | 3810683180700 |
10 | 1102122121221 |
11 | 395453229090 |
12 | 159722575599 |
13 | 7cc1163cbc4 |
14 | 3b4b3271509 |
15 | 1da06e378b6 |
hex | 1009b98f805 |
1102122121221 has 80 divisors (see below), whose sum is σ = 1963046942208. Its totient is φ = 608381798400.
The previous prime is 1102122121201. The next prime is 1102122121237. The reversal of 1102122121221 is 1221212212011.
1102122121221 is a `hidden beast` number, since 110 + 212 + 2 + 121 + 221 = 666.
It is not a de Polignac number, because 1102122121221 - 26 = 1102122121157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1102122121194 and 1102122121203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102122121201) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 704020 + ... + 1643133.
Almost surely, 21102122121221 is an apocalyptic number.
1102122121221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1102122121221 is a deficient number, since it is larger than the sum of its proper divisors (860924820987).
1102122121221 is a wasteful number, since it uses less digits than its factorization.
1102122121221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2347224 (or 2347215 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 1102122121221 its reverse (1221212212011), we get a palindrome (2323334333232).
The spelling of 1102122121221 in words is "one trillion, one hundred two billion, one hundred twenty-two million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •