Base | Representation |
---|---|
bin | 1010000110110100100111… |
… | …1100100100110110110010 |
3 | 1110100022211202110020101101 |
4 | 2201231021330210312302 |
5 | 2424031013134323442 |
6 | 35344532500355014 |
7 | 2224560450055132 |
oct | 241551174446662 |
9 | 43308752406341 |
10 | 11112321011122 |
11 | 35a4788571031 |
12 | 12b57859a5a6a |
13 | 627b6c741806 |
14 | 2a5ba6ad6ac2 |
15 | 1440cc423cb7 |
hex | a1b49f24db2 |
11112321011122 has 8 divisors (see below), whose sum is σ = 16680621711276. Its totient is φ = 5552113774032.
The previous prime is 11112321011119. The next prime is 11112321011123. The reversal of 11112321011122 is 22111012321111.
11112321011122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 7036811984601 + 4075509026521 = 2652699^2 + 2018789^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11112321011122.
It is not an unprimeable number, because it can be changed into a prime (11112321011123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2023362333 + ... + 2023367824.
Almost surely, 211112321011122 is an apocalyptic number.
11112321011122 is a deficient number, since it is larger than the sum of its proper divisors (5568300700154).
11112321011122 is a wasteful number, since it uses less digits than its factorization.
11112321011122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4046731532.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 11112321011122 its reverse (22111012321111), we get a palindrome (33223333332233).
The spelling of 11112321011122 in words is "eleven trillion, one hundred twelve billion, three hundred twenty-one million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •