Base | Representation |
---|---|
bin | 100000111001110001010… |
… | …011001100101000010001 |
3 | 22000011011201100120221001 |
4 | 200321301103030220101 |
5 | 244021114213434234 |
6 | 4450414054502001 |
7 | 322233005651632 |
oct | 40716123145021 |
9 | 8004151316831 |
10 | 2261053655569 |
11 | 7a19a8930075 |
12 | 30625a364901 |
13 | 1352a76b5b57 |
14 | 7b61533b889 |
15 | 3dc36433d14 |
hex | 20e714cca11 |
2261053655569 has 2 divisors, whose sum is σ = 2261053655570. Its totient is φ = 2261053655568.
The previous prime is 2261053655533. The next prime is 2261053655593. The reversal of 2261053655569 is 9655563501622.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2135923790400 + 125129865169 = 1461480^2 + 353737^2 .
It is a cyclic number.
It is not a de Polignac number, because 2261053655569 - 29 = 2261053655057 is a prime.
It is a super-2 number, since 2×22610536555692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2261053655369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1130526827784 + 1130526827785.
It is an arithmetic number, because the mean of its divisors is an integer number (1130526827785).
Almost surely, 22261053655569 is an apocalyptic number.
It is an amenable number.
2261053655569 is a deficient number, since it is larger than the sum of its proper divisors (1).
2261053655569 is an equidigital number, since it uses as much as digits as its factorization.
2261053655569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580000, while the sum is 55.
The spelling of 2261053655569 in words is "two trillion, two hundred sixty-one billion, fifty-three million, six hundred fifty-five thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •