Base | Representation |
---|---|
bin | 10000001011101001101… |
… | …000010011101010101100 |
3 | 10221022022200010000110120 |
4 | 100023221220103222230 |
5 | 121204404413020022 |
6 | 2210504442004540 |
7 | 143224631261133 |
oct | 20135150235254 |
9 | 3838280100416 |
10 | 1112021220012 |
11 | 399672a9656a |
12 | 15b6257a6750 |
13 | 80b2b45c601 |
14 | 3bb71c4a91a |
15 | 1ddd6013d5c |
hex | 102e9a13aac |
1112021220012 has 24 divisors (see below), whose sum is σ = 2598921572016. Its totient is φ = 370072969728.
The previous prime is 1112021219891. The next prime is 1112021220017. The reversal of 1112021220012 is 2100221202111.
It is a junction number, because it is equal to n+sod(n) for n = 1112021219973 and 1112021220000.
It is not an unprimeable number, because it can be changed into a prime (1112021220017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75088573 + ... + 75103380.
It is an arithmetic number, because the mean of its divisors is an integer number (108288398834).
Almost surely, 21112021220012 is an apocalyptic number.
1112021220012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1112021220012 is an abundant number, since it is smaller than the sum of its proper divisors (1486900352004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112021220012 is a wasteful number, since it uses less digits than its factorization.
1112021220012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150192577 (or 150192575 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1112021220012 its reverse (2100221202111), we get a palindrome (3212242422123).
The spelling of 1112021220012 in words is "one trillion, one hundred twelve billion, twenty-one million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •