Base | Representation |
---|---|
bin | 1000011011000100… |
… | …1000010101001001 |
3 | 12211120112000202012 |
4 | 2012301020111021 |
5 | 14112310313441 |
6 | 1012205345305 |
7 | 110013255614 |
oct | 20661102511 |
9 | 5746460665 |
10 | 2261026121 |
11 | a60321432 |
12 | 531268235 |
13 | 2a057a6a3 |
14 | 17640517b |
15 | d37739eb |
hex | 86c48549 |
2261026121 has 2 divisors, whose sum is σ = 2261026122. Its totient is φ = 2261026120.
The previous prime is 2261026099. The next prime is 2261026123. The reversal of 2261026121 is 1216201622.
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., 2066702521 + 194323600 = 45461^2 + 13940^2 .
It is a cyclic number.
It is not a de Polignac number, because 2261026121 - 222 = 2256831817 is a prime.
It is a super-2 number, since 2×22610261212 = 10224478239688613282, which contains 22 as substring.
Together with 2261026123, 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 (2261026123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1130513060 + 1130513061.
It is an arithmetic number, because the mean of its divisors is an integer number (1130513061).
Almost surely, 22261026121 is an apocalyptic number.
It is an amenable number.
2261026121 is a deficient number, since it is larger than the sum of its proper divisors (1).
2261026121 is an equidigital number, since it uses as much as digits as its factorization.
2261026121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
The square root of 2261026121 is about 47550.2483800032. The cubic root of 2261026121 is about 1312.5076998611.
Adding to 2261026121 its reverse (1216201622), we get a palindrome (3477227743).
The spelling of 2261026121 in words is "two billion, two hundred sixty-one million, twenty-six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •