Base | Representation |
---|---|
bin | 1010000111010001010000… |
… | …1111110100100011111000 |
3 | 1110101001200121200102012011 |
4 | 2201310110033310203320 |
5 | 2424142240031133422 |
6 | 35352243450455304 |
7 | 2225252133423646 |
oct | 241642417644370 |
9 | 43331617612164 |
10 | 11120010021112 |
11 | 35a7a73839043 |
12 | 12b7170a34534 |
13 | 6287c6709775 |
14 | 2a62d5d6a196 |
15 | 1443cc48e077 |
hex | a1d143f48f8 |
11120010021112 has 64 divisors (see below), whose sum is σ = 22595116199040. Its totient is φ = 5110495488000.
The previous prime is 11120010021031. The next prime is 11120010021143. The reversal of 11120010021112 is 21112001002111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 11120010021092 and 11120010021101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1059862 + ... + 4833562.
It is an arithmetic number, because the mean of its divisors is an integer number (353048690610).
Almost surely, 211120010021112 is an apocalyptic number.
It is an amenable number.
11120010021112 is an abundant number, since it is smaller than the sum of its proper divisors (11475106177928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120010021112 is a wasteful number, since it uses less digits than its factorization.
11120010021112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3774232 (or 3774228 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11120010021112 its reverse (21112001002111), we get a palindrome (32232011023223).
It can be divided in two parts, 1112001002111 and 2, that multiplied together give a palindrome (2224002004222).
The spelling of 11120010021112 in words is "eleven trillion, one hundred twenty billion, ten million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •