Base | Representation |
---|---|
bin | 1010000111010001010011… |
… | …1101100110000001111110 |
3 | 1110101001201110021000212122 |
4 | 2201310110331212001332 |
5 | 2424142301114121342 |
6 | 35352245000002542 |
7 | 2225252340420533 |
oct | 241642475460176 |
9 | 43331643230778 |
10 | 11120022020222 |
11 | 35a7a7a594165 |
12 | 12b7174a60452 |
13 | 6287c904b22b |
14 | 2a62d77b0d8a |
15 | 1443cd55e4d2 |
hex | a1d14f6607e |
11120022020222 has 32 divisors (see below), whose sum is σ = 17680101338592. Its totient is φ = 5227357584384.
The previous prime is 11120022020221. The next prime is 11120022020251. The reversal of 11120022020222 is 22202022002111.
It is a happy number.
11120022020222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 11120022020222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120022020221) 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, 121387628 + ... + 121479200.
It is an arithmetic number, because the mean of its divisors is an integer number (552503166831).
Almost surely, 211120022020222 is an apocalyptic number.
11120022020222 is a deficient number, since it is larger than the sum of its proper divisors (6560079318370).
11120022020222 is a wasteful number, since it uses less digits than its factorization.
11120022020222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95372.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 11120022020222 its reverse (22202022002111), we get a palindrome (33322044022333).
The spelling of 11120022020222 in words is "eleven trillion, one hundred twenty billion, twenty-two million, twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •