Base | Representation |
---|---|
bin | 111010100011000000101… |
… | …011100001000011110011 |
3 | 112020121220020012011211121 |
4 | 322203000223201003303 |
5 | 1011404230414202011 |
6 | 12320142201523111 |
7 | 563450445632536 |
oct | 72430053410363 |
9 | 15217806164747 |
10 | 4023322022131 |
11 | 1311310437025 |
12 | 54b8b64a3497 |
13 | 2325227c6329 |
14 | dca308d4a1d |
15 | 6e9c86c8e71 |
hex | 3a8c0ae10f3 |
4023322022131 has 2 divisors, whose sum is σ = 4023322022132. Its totient is φ = 4023322022130.
The previous prime is 4023322022123. The next prime is 4023322022171. The reversal of 4023322022131 is 1312202233204.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4023322022131 - 23 = 4023322022123 is a prime.
It is a super-2 number, since 2×40233220221312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4023322022096 and 4023322022105.
It is not a weakly prime, because it can be changed into another prime (4023322022171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011661011065 + 2011661011066.
It is an arithmetic number, because the mean of its divisors is an integer number (2011661011066).
Almost surely, 24023322022131 is an apocalyptic number.
4023322022131 is a deficient number, since it is larger than the sum of its proper divisors (1).
4023322022131 is an equidigital number, since it uses as much as digits as its factorization.
4023322022131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 4023322022131 its reverse (1312202233204), we get a palindrome (5335524255335).
The spelling of 4023322022131 in words is "four trillion, twenty-three billion, three hundred twenty-two million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •