Base | Representation |
---|---|
bin | 11101011011100010110… |
… | …11000000100011010000 |
3 | 10120200010200020122220220 |
4 | 32231301123000203100 |
5 | 113031434334020422 |
6 | 2052314222433040 |
7 | 133025660023014 |
oct | 16556133004320 |
9 | 3520120218826 |
10 | 1011220220112 |
11 | 35a9464a7383 |
12 | 143b93732780 |
13 | 74485a09b3b |
14 | 36d2c680544 |
15 | 1b486805e5c |
hex | eb716c08d0 |
1011220220112 has 80 divisors (see below), whose sum is σ = 2749984733760. Its totient is φ = 319312336896.
The previous prime is 1011220220099. The next prime is 1011220220117. The reversal of 1011220220112 is 2110220221101.
It is a junction number, because it is equal to n+sod(n) for n = 1011220220091 and 1011220220100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011220220117) 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, 21383758 + ... + 21430994.
It is an arithmetic number, because the mean of its divisors is an integer number (34374809172).
Almost surely, 21011220220112 is an apocalyptic number.
1011220220112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1011220220112 is an abundant number, since it is smaller than the sum of its proper divisors (1738764513648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011220220112 is a wasteful number, since it uses less digits than its factorization.
1011220220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70740 (or 70734 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1011220220112 its reverse (2110220221101), we get a palindrome (3121440441213).
The spelling of 1011220220112 in words is "one trillion, eleven billion, two hundred twenty million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •