Base | Representation |
---|---|
bin | 10001110000001110111… |
… | …111110110111011001011 |
3 | 11022122002110021000112012 |
4 | 101300032333312323023 |
5 | 124442101204130011 |
6 | 2332245344410135 |
7 | 154100201504060 |
oct | 21601677667313 |
9 | 4278073230465 |
10 | 1220022333131 |
11 | 43045488a348 |
12 | 17854701694b |
13 | 8b0807b19c4 |
14 | 43099784c67 |
15 | 21b078b8a8b |
hex | 11c0eff6ecb |
1220022333131 has 4 divisors (see below), whose sum is σ = 1394311237872. Its totient is φ = 1045733428392.
The previous prime is 1220022333119. The next prime is 1220022333133. The reversal of 1220022333131 is 1313332200221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1220022333131 - 230 = 1218948591307 is a prime.
It is a super-2 number, since 2×12200223331312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1220022333097 and 1220022333106.
It is not an unprimeable number, because it can be changed into a prime (1220022333133) 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, 87144452360 + ... + 87144452373.
It is an arithmetic number, because the mean of its divisors is an integer number (348577809468).
Almost surely, 21220022333131 is an apocalyptic number.
1220022333131 is a deficient number, since it is larger than the sum of its proper divisors (174288904741).
1220022333131 is an equidigital number, since it uses as much as digits as its factorization.
1220022333131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174288904740.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 1220022333131 its reverse (1313332200221), we get a palindrome (2533354533352).
The spelling of 1220022333131 in words is "one trillion, two hundred twenty billion, twenty-two million, three hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •