Base | Representation |
---|---|
bin | 1010001110110000110100… |
… | …00101010000010001000001 |
3 | 2221122201220210200212210102 |
4 | 11013120122011100101001 |
5 | 10422044312412001114 |
6 | 115503110430212145 |
7 | 4511250302113223 |
oct | 507303205202101 |
9 | 87581823625712 |
10 | 22497476281409 |
11 | 7194142942178 |
12 | 26341b3354055 |
13 | c7266cb8085c |
14 | 57ac52aa8413 |
15 | 2903271332de |
hex | 14761a150441 |
22497476281409 has 2 divisors, whose sum is σ = 22497476281410. Its totient is φ = 22497476281408.
The previous prime is 22497476281351. The next prime is 22497476281411. The reversal of 22497476281409 is 90418267479422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14635957535809 + 7861518745600 = 3825697^2 + 2803840^2 .
It is a cyclic number.
It is not a de Polignac number, because 22497476281409 - 216 = 22497476215873 is a prime.
It is a super-2 number, since 2×224974762814092 (a number of 28 digits) contains 22 as substring.
Together with 22497476281411, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (22497476283409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11248738140704 + 11248738140705.
It is an arithmetic number, because the mean of its divisors is an integer number (11248738140705).
Almost surely, 222497476281409 is an apocalyptic number.
It is an amenable number.
22497476281409 is a deficient number, since it is larger than the sum of its proper divisors (1).
22497476281409 is an equidigital number, since it uses as much as digits as its factorization.
22497476281409 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 97542144, while the sum is 65.
The spelling of 22497476281409 in words is "twenty-two trillion, four hundred ninety-seven billion, four hundred seventy-six million, two hundred eighty-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •