Base | Representation |
---|---|
bin | 1010000001100100100110… |
… | …1010101111000010011110 |
3 | 1110000201000122010210011100 |
4 | 2200121021222233002132 |
5 | 2421041301214133042 |
6 | 35235254251133530 |
7 | 2215215313231410 |
oct | 240311152570236 |
9 | 43021018123140 |
10 | 11022122021022 |
11 | 356a501597812 |
12 | 12a01b24442a6 |
13 | 61c4c6629b18 |
14 | 2a168b5da9b0 |
15 | 141a9d88c24c |
hex | a0649aaf09e |
11022122021022 has 48 divisors (see below), whose sum is σ = 27293059677312. Its totient is φ = 3149156247120.
The previous prime is 11022122020993. The next prime is 11022122021047. The reversal of 11022122021022 is 22012022122011.
It is a happy number.
11022122021022 is a `hidden beast` number, since 1 + 10 + 221 + 220 + 210 + 2 + 2 = 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 = 11022122020986 and 11022122021004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32579997 + ... + 32916567.
It is an arithmetic number, because the mean of its divisors is an integer number (568605409944).
Almost surely, 211022122021022 is an apocalyptic number.
11022122021022 is an abundant number, since it is smaller than the sum of its proper divisors (16270937656290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022122021022 is a wasteful number, since it uses less digits than its factorization.
11022122021022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 596493 (or 596490 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11022122021022 its reverse (22012022122011), we get a palindrome (33034144143033).
The spelling of 11022122021022 in words is "eleven trillion, twenty-two billion, one hundred twenty-two million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •