Base | Representation |
---|---|
bin | 1010000100000100011010… |
… | …11000001010110001011111 |
3 | 2220100121111202222011210101 |
4 | 11002002031120022301133 |
5 | 10400034312104311111 |
6 | 115022222425121531 |
7 | 4442562051325213 |
oct | 502021530126137 |
9 | 86317452864711 |
10 | 22130043432031 |
11 | 7062331652097 |
12 | 2594b4a9292a7 |
13 | c46b14718652 |
14 | 567157c80943 |
15 | 2859be905bc1 |
hex | 14208d60ac5f |
22130043432031 has 2 divisors, whose sum is σ = 22130043432032. Its totient is φ = 22130043432030.
The previous prime is 22130043432001. The next prime is 22130043432089. The reversal of 22130043432031 is 13023434003122.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 22130043432031 - 223 = 22130035043423 is a prime.
It is a super-2 number, since 2×221300434320312 (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 (22130043432001) 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, 11065021716015 + 11065021716016.
It is an arithmetic number, because the mean of its divisors is an integer number (11065021716016).
Almost surely, 222130043432031 is an apocalyptic number.
22130043432031 is a deficient number, since it is larger than the sum of its proper divisors (1).
22130043432031 is an equidigital number, since it uses as much as digits as its factorization.
22130043432031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 22130043432031 its reverse (13023434003122), we get a palindrome (35153477435153).
The spelling of 22130043432031 in words is "twenty-two trillion, one hundred thirty billion, forty-three million, four hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •