Base | Representation |
---|---|
bin | 1110010010100000011111… |
… | …01100010001010111011011 |
3 | 11010020221022012200220012212 |
4 | 13021100033230101113123 |
5 | 13104310223431014433 |
6 | 150455102444025335 |
7 | 6422116333053644 |
oct | 711201754212733 |
9 | 133227265626185 |
10 | 31422244001243 |
11 | a01510a620747 |
12 | 3635a11b3224b |
13 | 146c1495ba224 |
14 | 7a8bb7cd06cb |
15 | 397570bb3d48 |
hex | 1c940fb115db |
31422244001243 has 2 divisors, whose sum is σ = 31422244001244. Its totient is φ = 31422244001242.
The previous prime is 31422244001233. The next prime is 31422244001251. The reversal of 31422244001243 is 34210044222413.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31422244001243 is a prime.
It is a super-4 number, since 4×314222440012434 (a number of 55 digits) contains 4444 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (31422244001233) 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, 15711122000621 + 15711122000622.
It is an arithmetic number, because the mean of its divisors is an integer number (15711122000622).
Almost surely, 231422244001243 is an apocalyptic number.
31422244001243 is a deficient number, since it is larger than the sum of its proper divisors (1).
31422244001243 is an equidigital number, since it uses as much as digits as its factorization.
31422244001243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 32.
Adding to 31422244001243 its reverse (34210044222413), we get a palindrome (65632288223656).
The spelling of 31422244001243 in words is "thirty-one trillion, four hundred twenty-two billion, two hundred forty-four million, one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •