Base | Representation |
---|---|
bin | 10100100001110100… |
… | …01101001011001100 |
3 | 1001110002011111110210 |
4 | 22100322031023030 |
5 | 140032401041022 |
6 | 5021340402420 |
7 | 540053622621 |
oct | 122072151314 |
9 | 31402144423 |
10 | 11021112012 |
11 | 4746148639 |
12 | 2176b46410 |
13 | 1068409c71 |
14 | 767a08348 |
15 | 44785ea0c |
hex | 290e8d2cc |
11021112012 has 12 divisors (see below), whose sum is σ = 25715928056. Its totient is φ = 3673704000.
The previous prime is 11021111903. The next prime is 11021112043. The reversal of 11021112012 is 21021112011.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 918426001 = 11021112012 / (1 + 1 + 0 + 2 + 1 + 1 + 1 + 2 + 0 + 1 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 459212989 + ... + 459213012.
Almost surely, 211021112012 is an apocalyptic number.
11021112012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11021112012 is an abundant number, since it is smaller than the sum of its proper divisors (14694816044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021112012 is a wasteful number, since it uses less digits than its factorization.
11021112012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918426008 (or 918426006 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11021112012 its reverse (21021112011), we get a palindrome (32042224023).
Subtracting 11021112012 from its reverse (21021112011), we obtain a palindrome (9999999999).
The spelling of 11021112012 in words is "eleven billion, twenty-one million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •