Base | Representation |
---|---|
bin | 1001101101000101… |
… | …0111101101010001 |
3 | 20201112210211102112 |
4 | 2123101113231101 |
5 | 20313341201113 |
6 | 1110254355105 |
7 | 121361215265 |
oct | 23321275521 |
9 | 6645724375 |
10 | 2605022033 |
11 | 1117515679 |
12 | 6084bba95 |
13 | 326910a73 |
14 | 1a9d8c0a5 |
15 | 103a735a8 |
hex | 9b457b51 |
2605022033 has 2 divisors, whose sum is σ = 2605022034. Its totient is φ = 2605022032.
The previous prime is 2605021973. The next prime is 2605022041. The reversal of 2605022033 is 3302205062.
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., 1606967569 + 998054464 = 40087^2 + 31592^2 .
It is a cyclic number.
It is not a de Polignac number, because 2605022033 - 28 = 2605021777 is a prime.
It is a super-2 number, since 2×26050220332 = 13572279584830906178, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2605022053) 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, 1302511016 + 1302511017.
It is an arithmetic number, because the mean of its divisors is an integer number (1302511017).
Almost surely, 22605022033 is an apocalyptic number.
It is an amenable number.
2605022033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2605022033 is an equidigital number, since it uses as much as digits as its factorization.
2605022033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 23.
The square root of 2605022033 is about 51039.4164641407. The cubic root of 2605022033 is about 1375.9536362784.
Adding to 2605022033 its reverse (3302205062), we get a palindrome (5907227095).
The spelling of 2605022033 in words is "two billion, six hundred five million, twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •