Base | Representation |
---|---|
bin | 10100101101110000… |
… | …00110000101111100 |
3 | 1001201001112121120120 |
4 | 22112320012011330 |
5 | 140234013101022 |
6 | 5035314214540 |
7 | 542410553535 |
oct | 122670060574 |
9 | 31631477516 |
10 | 11121222012 |
11 | 479770477a |
12 | 21a4584450 |
13 | 108308b854 |
14 | 77702768c |
15 | 451536d5c |
hex | 296e0617c |
11121222012 has 12 divisors (see below), whose sum is σ = 25949518056. Its totient is φ = 3707074000.
The previous prime is 11121221983. The next prime is 11121222023. The reversal of 11121222012 is 21022212111.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 11121221982 and 11121222000.
It is a congruent number.
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, 463384239 + ... + 463384262.
It is an arithmetic number, because the mean of its divisors is an integer number (2162459838).
Almost surely, 211121222012 is an apocalyptic number.
11121222012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11121222012 is an abundant number, since it is smaller than the sum of its proper divisors (14828296044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121222012 is a wasteful number, since it uses less digits than its factorization.
11121222012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 926768508 (or 926768506 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11121222012 its reverse (21022212111), we get a palindrome (32143434123).
Subtracting 11121222012 from its reverse (21022212111), we obtain a palindrome (9900990099).
The spelling of 11121222012 in words is "eleven billion, one hundred twenty-one million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.337 sec. • engine limits •