Base | Representation |
---|---|
bin | 10001110000001110111… |
… | …110101000010011111011 |
3 | 11022122002102122122211021 |
4 | 101300032332220103323 |
5 | 124442101113324011 |
6 | 2332245333443311 |
7 | 154100165663230 |
oct | 21601676502373 |
9 | 4278072578737 |
10 | 1220022011131 |
11 | 43045468a430 |
12 | 178546aa0537 |
13 | 8b0806cb281 |
14 | 430996dd787 |
15 | 21b07853471 |
hex | 11c0efa84fb |
1220022011131 has 8 divisors (see below), whose sum is σ = 1521066403584. Its totient is φ = 950666502120.
The previous prime is 1220022011123. The next prime is 1220022011177. The reversal of 1220022011131 is 1311102200221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1220022011131 - 23 = 1220022011123 is a prime.
It is a super-2 number, since 2×12200220111312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1220022011531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7922220775 + ... + 7922220928.
It is an arithmetic number, because the mean of its divisors is an integer number (190133300448).
Almost surely, 21220022011131 is an apocalyptic number.
1220022011131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1220022011131 is a deficient number, since it is larger than the sum of its proper divisors (301044392453).
1220022011131 is a wasteful number, since it uses less digits than its factorization.
1220022011131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15844441721.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1220022011131 its reverse (1311102200221), we get a palindrome (2531124211352).
The spelling of 1220022011131 in words is "one trillion, two hundred twenty billion, twenty-two million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •