Base | Representation |
---|---|
bin | 10000010100000010001… |
… | …000010100100110011101 |
3 | 10222011112222001012001221 |
4 | 100110002020110212131 |
5 | 121331323140401341 |
6 | 2214553540133341 |
7 | 143663655324010 |
oct | 20240210244635 |
9 | 3864488035057 |
10 | 1121022200221 |
11 | 3a2471897190 |
12 | 161318097251 |
13 | 81934193ac1 |
14 | 3c387439377 |
15 | 1e261335ed1 |
hex | 1050221499d |
1121022200221 has 16 divisors (see below), whose sum is σ = 1397671193088. Its totient is φ = 873503089200.
The previous prime is 1121022200209. The next prime is 1121022200237. The reversal of 1121022200221 is 1220022201211.
It is a happy number.
It is not a de Polignac number, because 1121022200221 - 213 = 1121022192029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121022200195 and 1121022200204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121022200321) 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, 3641326 + ... + 3937168.
It is an arithmetic number, because the mean of its divisors is an integer number (87354449568).
Almost surely, 21121022200221 is an apocalyptic number.
1121022200221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1121022200221 is a deficient number, since it is larger than the sum of its proper divisors (276648992867).
1121022200221 is a wasteful number, since it uses less digits than its factorization.
1121022200221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 345072.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1121022200221 its reverse (1220022201211), we get a palindrome (2341044401432).
The spelling of 1121022200221 in words is "one trillion, one hundred twenty-one billion, twenty-two million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •