Base | Representation |
---|---|
bin | 1100101010011000000110… |
… | …1000000010100000011111 |
3 | 1211021221112112022102220111 |
4 | 3022212001220002200133 |
5 | 3311100042410410411 |
6 | 45335430450230451 |
7 | 2634562124302423 |
oct | 312460150024037 |
9 | 54257475272814 |
10 | 13922163763231 |
11 | 44883a1548989 |
12 | 168a260585427 |
13 | 79cb151a3b09 |
14 | 361b9cc1ab83 |
15 | 19223288e721 |
hex | ca981a0281f |
13922163763231 has 2 divisors, whose sum is σ = 13922163763232. Its totient is φ = 13922163763230.
The previous prime is 13922163763177. The next prime is 13922163763247. The reversal of 13922163763231 is 13236736122931.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13922163763231 - 213 = 13922163755039 is a prime.
It is a super-2 number, since 2×139221637632312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13922163763271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6961081881615 + 6961081881616.
It is an arithmetic number, because the mean of its divisors is an integer number (6961081881616).
Almost surely, 213922163763231 is an apocalyptic number.
13922163763231 is a deficient number, since it is larger than the sum of its proper divisors (1).
13922163763231 is an equidigital number, since it uses as much as digits as its factorization.
13922163763231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1469664, while the sum is 49.
The spelling of 13922163763231 in words is "thirteen trillion, nine hundred twenty-two billion, one hundred sixty-three million, seven hundred sixty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •