Base | Representation |
---|---|
bin | 1010000001100001001111… |
… | …1101101100100101000110 |
3 | 1110000121200211202021220000 |
4 | 2200120103331230211012 |
5 | 2421032430040201042 |
6 | 35235025023422130 |
7 | 2215154062662231 |
oct | 240302375544506 |
9 | 43017624667800 |
10 | 11021221022022 |
11 | 356a089a42942 |
12 | 129bba0754946 |
13 | 61c3b1a73813 |
14 | 2a1603aa0418 |
15 | 141a4971474c |
hex | a0613f6c946 |
11021221022022 has 20 divisors (see below), whose sum is σ = 24695698957116. Its totient is φ = 3673740340620.
The previous prime is 11021221021969. The next prime is 11021221022027. The reversal of 11021221022022 is 22022012212011.
It is a happy number.
11021221022022 is a `hidden beast` number, since 1 + 1 + 0 + 212 + 210 + 220 + 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 = 11021221021986 and 11021221022004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021221022027) 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, 34016114104 + ... + 34016114427.
Almost surely, 211021221022022 is an apocalyptic number.
11021221022022 is an abundant number, since it is smaller than the sum of its proper divisors (13674477935094).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021221022022 is an equidigital number, since it uses as much as digits as its factorization.
11021221022022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68032228545 (or 68032228536 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 11021221022022 its reverse (22022012212011), we get a palindrome (33043233234033).
The spelling of 11021221022022 in words is "eleven trillion, twenty-one billion, two hundred twenty-one million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •