Base | Representation |
---|---|
bin | 1001000010001111… |
… | …1100000010000001 |
3 | 20021000201001001122 |
4 | 2100203330002001 |
5 | 14431341340113 |
6 | 1040355242025 |
7 | 114050023124 |
oct | 22043740201 |
9 | 6230631048 |
10 | 2425340033 |
11 | 103504a956 |
12 | 5782a9315 |
13 | 2c861b85c |
14 | 1901783bb |
15 | e2dce408 |
hex | 908fc081 |
2425340033 has 2 divisors, whose sum is σ = 2425340034. Its totient is φ = 2425340032.
The previous prime is 2425339999. The next prime is 2425340039. The reversal of 2425340033 is 3300435242.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1682886529 + 742453504 = 41023^2 + 27248^2 .
It is a cyclic number.
It is not a de Polignac number, because 2425340033 - 210 = 2425339009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2425339984 and 2425340011.
It is not a weakly prime, because it can be changed into another prime (2425340039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1212670016 + 1212670017.
It is an arithmetic number, because the mean of its divisors is an integer number (1212670017).
Almost surely, 22425340033 is an apocalyptic number.
It is an amenable number.
2425340033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2425340033 is an equidigital number, since it uses as much as digits as its factorization.
2425340033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 26.
The square root of 2425340033 is about 49247.7413999871. The cubic root of 2425340033 is about 1343.5614831613.
Adding to 2425340033 its reverse (3300435242), we get a palindrome (5725775275).
The spelling of 2425340033 in words is "two billion, four hundred twenty-five million, three hundred forty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •