Base | Representation |
---|---|
bin | 1010001101001001111001… |
… | …0101111010010001111110 |
3 | 1110201201122112020102120000 |
4 | 2203102132111322101332 |
5 | 2432321313421333042 |
6 | 35510523550135130 |
7 | 2235461410536165 |
oct | 243223625722176 |
9 | 43651575212500 |
10 | 11221111121022 |
11 | 363693476a870 |
12 | 13128874b14a6 |
13 | 6351b93936ca |
14 | 2ab1673343dc |
15 | 146d481ca74c |
hex | a349e57a47e |
11221111121022 has 80 divisors (see below), whose sum is σ = 27508431468672. Its totient is φ = 3390537275280.
The previous prime is 11221111120987. The next prime is 11221111121023. The reversal of 11221111121022 is 22012111112211.
It is a happy number.
11221111121022 is a `hidden beast` number, since 112 + 211 + 111 + 210 + 22 = 666.
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 = 11221111120986 and 11221111121004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11221111121023) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 8455018 + ... + 9691725.
Almost surely, 211221111121022 is an apocalyptic number.
11221111121022 is an abundant number, since it is smaller than the sum of its proper divisors (16287320347650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11221111121022 is a wasteful number, since it uses less digits than its factorization.
11221111121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18147115 (or 18147106 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 11221111121022 its reverse (22012111112211), we get a palindrome (33233222233233).
The spelling of 11221111121022 in words is "eleven trillion, two hundred twenty-one billion, one hundred eleven million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •