Base | Representation |
---|---|
bin | 10000000010011011100… |
… | …010110011111110000110 |
3 | 10220100202201112000022100 |
4 | 100002123202303332012 |
5 | 121024121013101042 |
6 | 2202150230412530 |
7 | 142424406550212 |
oct | 20023342637606 |
9 | 3810681460270 |
10 | 1102121222022 |
11 | 395452774547 |
12 | 159722201146 |
13 | 7cc113b6832 |
14 | 3b4b30b9942 |
15 | 1da06d0b24c |
hex | 1009b8b3f86 |
1102121222022 has 48 divisors (see below), whose sum is σ = 2392774413120. Its totient is φ = 366629106816.
The previous prime is 1102121222011. The next prime is 1102121222053. The reversal of 1102121222022 is 2202221212011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1102121221986 and 1102121222004.
It is a congruent number.
It is an unprimeable number.
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 in 23 ways as a sum of consecutive naturals, for example, 17792088 + ... + 17853924.
It is an arithmetic number, because the mean of its divisors is an integer number (49849466940).
Almost surely, 21102121222022 is an apocalyptic number.
1102121222022 is an abundant number, since it is smaller than the sum of its proper divisors (1290653191098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102121222022 is a wasteful number, since it uses less digits than its factorization.
1102121222022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63837 (or 63834 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 1102121222022 its reverse (2202221212011), we get a palindrome (3304342434033).
The spelling of 1102121222022 in words is "one trillion, one hundred two billion, one hundred twenty-one million, two hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •