Base | Representation |
---|---|
bin | 1010000110101100000001… |
… | …0100011110110100000110 |
3 | 1110100002212211200102210120 |
4 | 2201223000110132310012 |
5 | 2424011301034201042 |
6 | 35343511415002410 |
7 | 2224446312014364 |
oct | 241530024366406 |
9 | 43302784612716 |
10 | 11110012022022 |
11 | 35a3803170381 |
12 | 12b5240669406 |
13 | 62789226cc84 |
14 | 2a5a281a8634 |
15 | 143ee4878dec |
hex | a1ac051ed06 |
11110012022022 has 8 divisors (see below), whose sum is σ = 22220024044056. Its totient is φ = 3703337340672.
The previous prime is 11110012022009. The next prime is 11110012022029. The reversal of 11110012022022 is 22022021001111.
It is a sphenic number, since it is the product of 3 distinct primes.
11110012022022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11110012021992 and 11110012022010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110012022029) 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, 925834335163 + ... + 925834335174.
It is an arithmetic number, because the mean of its divisors is an integer number (2777503005507).
Almost surely, 211110012022022 is an apocalyptic number.
11110012022022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110012022022 is a wasteful number, since it uses less digits than its factorization.
11110012022022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1851668670342.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11110012022022 its reverse (22022021001111), we get a palindrome (33132033023133).
The spelling of 11110012022022 in words is "eleven trillion, one hundred ten billion, twelve million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •