Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …01100010010110010000 |
3 | 10112121110110200222210110 |
4 | 32203123101202112100 |
5 | 112341211433020422 |
6 | 2043240022201320 |
7 | 132153455051634 |
oct | 16433321422620 |
9 | 3477413628713 |
10 | 1000111220112 |
11 | 356165790244 |
12 | 1419b3283240 |
13 | 7340533a364 |
14 | 36597118dc4 |
15 | 1b0363d560c |
hex | e8db462590 |
1000111220112 has 160 divisors (see below), whose sum is σ = 2696035335552. Its totient is φ = 319165304832.
The previous prime is 1000111220047. The next prime is 1000111220137. The reversal of 1000111220112 is 2110221110001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 120534748 + ... + 120543044.
Almost surely, 21000111220112 is an apocalyptic number.
1000111220112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1000111220112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1348017667776).
1000111220112 is an abundant number, since it is smaller than the sum of its proper divisors (1695924115440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000111220112 is a wasteful number, since it uses less digits than its factorization.
1000111220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9425 (or 9419 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1000111220112 its reverse (2110221110001), we get a palindrome (3110332330113).
The spelling of 1000111220112 in words is "one trillion, one hundred eleven million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •