Base | Representation |
---|---|
bin | 1010000110001111010011… |
… | …11110110001101111110001 |
3 | 2220121201222112221120022002 |
4 | 11003013221332301233301 |
5 | 10402300021021013131 |
6 | 115120354021423345 |
7 | 4451141654420264 |
oct | 503075176615761 |
9 | 86551875846262 |
10 | 22204611501041 |
11 | 7090a17357002 |
12 | 25a749b56ab55 |
13 | c50b693803c8 |
14 | 56a9cd440cdb |
15 | 2878d609d6cb |
hex | 1431e9fb1bf1 |
22204611501041 has 2 divisors, whose sum is σ = 22204611501042. Its totient is φ = 22204611501040.
The previous prime is 22204611501001. The next prime is 22204611501077. The reversal of 22204611501041 is 14010511640222.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19246830668641 + 2957780832400 = 4387121^2 + 1719820^2 .
It is a cyclic number.
It is not a de Polignac number, because 22204611501041 - 26 = 22204611500977 is a prime.
It is a super-2 number, since 2×222046115010412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22204611500995 and 22204611501013.
It is not a weakly prime, because it can be changed into another prime (22204611501001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11102305750520 + 11102305750521.
It is an arithmetic number, because the mean of its divisors is an integer number (11102305750521).
Almost surely, 222204611501041 is an apocalyptic number.
It is an amenable number.
22204611501041 is a deficient number, since it is larger than the sum of its proper divisors (1).
22204611501041 is an equidigital number, since it uses as much as digits as its factorization.
22204611501041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3840, while the sum is 29.
The spelling of 22204611501041 in words is "twenty-two trillion, two hundred four billion, six hundred eleven million, five hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •