Base | Representation |
---|---|
bin | 1010001100000101001001… |
… | …10110101110000111101001 |
3 | 2221022221000221102002021022 |
4 | 11012002210312232013221 |
5 | 10414042041144132131 |
6 | 115352505411022225 |
7 | 4501505412052661 |
oct | 506024466560751 |
9 | 87287027362238 |
10 | 22405315224041 |
11 | 715904a37a762 |
12 | 261a37289a975 |
13 | c66a73413409 |
14 | 5765ccb891a1 |
15 | 28cc311cd37b |
hex | 1460a4dae1e9 |
22405315224041 has 2 divisors, whose sum is σ = 22405315224042. Its totient is φ = 22405315224040.
The previous prime is 22405315223957. The next prime is 22405315224059. The reversal of 22405315224041 is 14042251350422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16088281440400 + 6317033783641 = 4011020^2 + 2513371^2 .
It is a cyclic number.
It is not a de Polignac number, because 22405315224041 - 214 = 22405315207657 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22405315223992 and 22405315224010.
It is not a weakly prime, because it can be changed into another prime (22405315224641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11202657612020 + 11202657612021.
It is an arithmetic number, because the mean of its divisors is an integer number (11202657612021).
Almost surely, 222405315224041 is an apocalyptic number.
It is an amenable number.
22405315224041 is a deficient number, since it is larger than the sum of its proper divisors (1).
22405315224041 is an equidigital number, since it uses as much as digits as its factorization.
22405315224041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 76800, while the sum is 35.
Adding to 22405315224041 its reverse (14042251350422), we get a palindrome (36447566574463).
The spelling of 22405315224041 in words is "twenty-two trillion, four hundred five billion, three hundred fifteen million, two hundred twenty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •