Base | Representation |
---|---|
bin | 1010000001100000100000… |
… | …0110100100011001100110 |
3 | 1110000121011222022000010000 |
4 | 2200120020012210121212 |
5 | 2421032023114134342 |
6 | 35234553154242130 |
7 | 2215146125336043 |
oct | 240301006443146 |
9 | 43017158260100 |
10 | 11021022021222 |
11 | 3569a97682674 |
12 | 129bb45b86346 |
13 | 61c37c779275 |
14 | 2a15c549c1ca |
15 | 141a3700644c |
hex | a06081a4666 |
11021022021222 has 20 divisors (see below), whose sum is σ = 24695253047916. Its totient is φ = 3673674007020.
The previous prime is 11021022021209. The next prime is 11021022021223. The reversal of 11021022021222 is 22212022012011.
It is a happy number.
11021022021222 is a `hidden beast` number, since 1 + 1 + 0 + 210 + 220 + 212 + 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 = 11021022021195 and 11021022021204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021022021223) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 34015499904 + ... + 34015500227.
Almost surely, 211021022021222 is an apocalyptic number.
11021022021222 is an abundant number, since it is smaller than the sum of its proper divisors (13674231026694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021022021222 is an equidigital number, since it uses as much as digits as its factorization.
11021022021222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68031000145 (or 68031000136 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11021022021222 its reverse (22212022012011), we get a palindrome (33233044033233).
The spelling of 11021022021222 in words is "eleven trillion, twenty-one billion, twenty-two million, twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •