Base | Representation |
---|---|
bin | 100011010010101100100… |
… | …000000100011110001101 |
3 | 22120212000020100211001212 |
4 | 203102230200010132031 |
5 | 304213410421034041 |
6 | 5054051433144205 |
7 | 340135044554261 |
oct | 43225440043615 |
9 | 8525006324055 |
10 | 2425255643021 |
11 | 8555aa647632 |
12 | 33204525b065 |
13 | 147915375c83 |
14 | 85550d440a1 |
15 | 43146c448eb |
hex | 234ac80478d |
2425255643021 has 2 divisors, whose sum is σ = 2425255643022. Its totient is φ = 2425255643020.
The previous prime is 2425255643011. The next prime is 2425255643051. The reversal of 2425255643021 is 1203465525242.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1265143545796 + 1160112097225 = 1124786^2 + 1077085^2 .
It is a cyclic number.
It is not a de Polignac number, because 2425255643021 - 214 = 2425255626637 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2425255643021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2425255643011) 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, 1212627821510 + 1212627821511.
It is an arithmetic number, because the mean of its divisors is an integer number (1212627821511).
Almost surely, 22425255643021 is an apocalyptic number.
It is an amenable number.
2425255643021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2425255643021 is an equidigital number, since it uses as much as digits as its factorization.
2425255643021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576000, while the sum is 41.
The spelling of 2425255643021 in words is "two trillion, four hundred twenty-five billion, two hundred fifty-five million, six hundred forty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •