Base | Representation |
---|---|
bin | 11101101111101001001… |
… | …11011010010010000001 |
3 | 10121200222201102022102221 |
4 | 32313310213122102001 |
5 | 113221034333033441 |
6 | 2101301103211041 |
7 | 133560251021242 |
oct | 16676447322201 |
9 | 3550881368387 |
10 | 1022011221121 |
11 | 364483766130 |
12 | 1460a55a6a81 |
13 | 754b5549137 |
14 | 376738a8cc9 |
15 | 1b8b8d5e8d1 |
hex | edf49da481 |
1022011221121 has 16 divisors (see below), whose sum is σ = 1116976334976. Its totient is φ = 927389440000.
The previous prime is 1022011221113. The next prime is 1022011221137. The reversal of 1022011221121 is 1211221102201.
It is a cyclic number.
It is not a de Polignac number, because 1022011221121 - 23 = 1022011221113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022011221095 and 1022011221104.
It is not an unprimeable number, because it can be changed into a prime (1022011221151) 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, 27557931 + ... + 27594991.
It is an arithmetic number, because the mean of its divisors is an integer number (69811020936).
Almost surely, 21022011221121 is an apocalyptic number.
1022011221121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1022011221121 is a deficient number, since it is larger than the sum of its proper divisors (94965113855).
1022011221121 is a wasteful number, since it uses less digits than its factorization.
1022011221121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41624.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1022011221121 its reverse (1211221102201), we get a palindrome (2233232323322).
The spelling of 1022011221121 in words is "one trillion, twenty-two billion, eleven million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •