Base | Representation |
---|---|
bin | 101011111110110111100… |
… | …110001001100010000011 |
3 | 101200221110012022012100001 |
4 | 223332313212021202003 |
5 | 344004430203141011 |
6 | 10232254002340431 |
7 | 431235636102436 |
oct | 53766746114203 |
9 | 11627405265301 |
10 | 3022442240131 |
11 | a658a0938976 |
12 | 40992995a717 |
13 | 18c027192832 |
14 | a64036b581d |
15 | 53949acb7c1 |
hex | 2bfb7989883 |
3022442240131 has 2 divisors, whose sum is σ = 3022442240132. Its totient is φ = 3022442240130.
The previous prime is 3022442240123. The next prime is 3022442240143. The reversal of 3022442240131 is 1310422442203.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3022442240131 - 23 = 3022442240123 is a prime.
It is a super-2 number, since 2×30224422401312 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3022442240131.
It is not a weakly prime, because it can be changed into another prime (3022445240131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1511221120065 + 1511221120066.
It is an arithmetic number, because the mean of its divisors is an integer number (1511221120066).
Almost surely, 23022442240131 is an apocalyptic number.
3022442240131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3022442240131 is an equidigital number, since it uses as much as digits as its factorization.
3022442240131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 3022442240131 its reverse (1310422442203), we get a palindrome (4332864682334).
The spelling of 3022442240131 in words is "three trillion, twenty-two billion, four hundred forty-two million, two hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •