Base | Representation |
---|---|
bin | 1001000010001110… |
… | …0100001001111001 |
3 | 20021000112001220102 |
4 | 2100203210021321 |
5 | 14431330222413 |
6 | 1040353205145 |
7 | 114046135031 |
oct | 22043441171 |
9 | 6230461812 |
10 | 2425242233 |
11 | 1034a93427 |
12 | 5782607b5 |
13 | 2c85b619b |
14 | 1901508c1 |
15 | e2db0458 |
hex | 908e4279 |
2425242233 has 2 divisors, whose sum is σ = 2425242234. Its totient is φ = 2425242232.
The previous prime is 2425242217. The next prime is 2425242277. The reversal of 2425242233 is 3322425242.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2377245049 + 47997184 = 48757^2 + 6928^2 .
It is a cyclic number.
It is not a de Polignac number, because 2425242233 - 24 = 2425242217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2425242196 and 2425242205.
It is not a weakly prime, because it can be changed into another prime (2425242203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1212621116 + 1212621117.
It is an arithmetic number, because the mean of its divisors is an integer number (1212621117).
Almost surely, 22425242233 is an apocalyptic number.
It is an amenable number.
2425242233 is a deficient number, since it is larger than the sum of its proper divisors (1).
2425242233 is an equidigital number, since it uses as much as digits as its factorization.
2425242233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23040, while the sum is 29.
The square root of 2425242233 is about 49246.7484510399. The cubic root of 2425242233 is about 1343.5434235521.
Adding to 2425242233 its reverse (3322425242), we get a palindrome (5747667475).
The spelling of 2425242233 in words is "two billion, four hundred twenty-five million, two hundred forty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •