Base | Representation |
---|---|
bin | 1010001100100011010011… |
… | …00100101111001001111011 |
3 | 2221101110210220220110122011 |
4 | 11012101221210233021323 |
5 | 10414323213113220011 |
6 | 115404143430110351 |
7 | 4502620453611613 |
oct | 506215144571173 |
9 | 87343726813564 |
10 | 22421500523131 |
11 | 71649a55774a6 |
12 | 262152b1ab3b7 |
13 | c684526a7478 |
14 | 5772c6593a43 |
15 | 28d37c0c7621 |
hex | 14646992f27b |
22421500523131 has 2 divisors, whose sum is σ = 22421500523132. Its totient is φ = 22421500523130.
The previous prime is 22421500523099. The next prime is 22421500523239. The reversal of 22421500523131 is 13132500512422.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 22421500523131 - 25 = 22421500523099 is a prime.
It is a super-2 number, since 2×224215005231312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22421500523093 and 22421500523102.
It is not a weakly prime, because it can be changed into another prime (22421500521131) 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, 11210750261565 + 11210750261566.
It is an arithmetic number, because the mean of its divisors is an integer number (11210750261566).
Almost surely, 222421500523131 is an apocalyptic number.
22421500523131 is a deficient number, since it is larger than the sum of its proper divisors (1).
22421500523131 is an equidigital number, since it uses as much as digits as its factorization.
22421500523131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 31.
The spelling of 22421500523131 in words is "twenty-two trillion, four hundred twenty-one billion, five hundred million, five hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •