Base | Representation |
---|---|
bin | 10000001101111000101… |
… | …111000011100101001110 |
3 | 10221112111222211221012120 |
4 | 100031320233003211032 |
5 | 121224314031143042 |
6 | 2211543005513410 |
7 | 143341263550524 |
oct | 20157057034516 |
9 | 3845458757176 |
10 | 1114422131022 |
11 | 39a695270542 |
12 | 15bb95872866 |
13 | 811219a6b05 |
14 | 3bd1ca66314 |
15 | 1dec6bb9dec |
hex | 10378bc394e |
1114422131022 has 8 divisors (see below), whose sum is σ = 2228844262056. Its totient is φ = 371474043672.
The previous prime is 1114422130993. The next prime is 1114422131041. The reversal of 1114422131022 is 2201312244111.
It is a sphenic number, since it is the product of 3 distinct primes.
1114422131022 is an admirable number.
It is a super-2 number, since 2×11144221310222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1114422130983 and 1114422131001.
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, 92868510913 + ... + 92868510924.
It is an arithmetic number, because the mean of its divisors is an integer number (278605532757).
Almost surely, 21114422131022 is an apocalyptic number.
1114422131022 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.
1114422131022 is a wasteful number, since it uses less digits than its factorization.
1114422131022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 185737021842.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 1114422131022 its reverse (2201312244111), we get a palindrome (3315734375133).
The spelling of 1114422131022 in words is "one trillion, one hundred fourteen billion, four hundred twenty-two million, one hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •