Base | Representation |
---|---|
bin | 10000010101000011001… |
… | …001110001110011011100 |
3 | 10222021100222202200122020 |
4 | 100111003021301303130 |
5 | 121341041423213040 |
6 | 2215254110020140 |
7 | 144033002661552 |
oct | 20250311616334 |
9 | 3867328680566 |
10 | 1122113101020 |
11 | 3a298165709a |
12 | 1615814a7650 |
13 | 81a791a9c32 |
14 | 3c44c289bd2 |
15 | 1e2c6ec0cd0 |
hex | 10543271cdc |
1122113101020 has 48 divisors (see below), whose sum is σ = 3218548804128. Its totient is φ = 291931863040.
The previous prime is 1122113101009. The next prime is 1122113101091. The reversal of 1122113101020 is 201013112211.
It is a super-2 number, since 2×11221131010202 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 228069309 + ... + 228074228.
It is an arithmetic number, because the mean of its divisors is an integer number (67053100086).
Almost surely, 21122113101020 is an apocalyptic number.
1122113101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122113101020 is an abundant number, since it is smaller than the sum of its proper divisors (2096435703108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122113101020 is a wasteful number, since it uses less digits than its factorization.
1122113101020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 456143590 (or 456143588 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1122113101020 its reverse (201013112211), we get a palindrome (1323126213231).
The spelling of 1122113101020 in words is "one trillion, one hundred twenty-two billion, one hundred thirteen million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •