Base | Representation |
---|---|
bin | 1101000110011001001… |
… | …0010000101100101101 |
3 | 210111220102111011112001 |
4 | 3101212102100230231 |
5 | 12141402404044123 |
6 | 251215532012301 |
7 | 22155025342246 |
oct | 3214622205455 |
9 | 714812434461 |
10 | 225054362413 |
11 | 87499358541 |
12 | 3774a301091 |
13 | 182b7baa5aa |
14 | ac6d779ccd |
15 | 5cc2cd40ad |
hex | 3466490b2d |
225054362413 has 2 divisors, whose sum is σ = 225054362414. Its totient is φ = 225054362412.
The previous prime is 225054362411. The next prime is 225054362459. The reversal of 225054362413 is 314263450522.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 222974728804 + 2079633609 = 472202^2 + 45603^2 .
It is a cyclic number.
It is not a de Polignac number, because 225054362413 - 21 = 225054362411 is a prime.
It is a super-2 number, since 2×2250543624132 (a number of 24 digits) contains 22 as substring.
Together with 225054362411, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (225054362411) 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, 112527181206 + 112527181207.
It is an arithmetic number, because the mean of its divisors is an integer number (112527181207).
Almost surely, 2225054362413 is an apocalyptic number.
It is an amenable number.
225054362413 is a deficient number, since it is larger than the sum of its proper divisors (1).
225054362413 is an equidigital number, since it uses as much as digits as its factorization.
225054362413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172800, while the sum is 37.
The spelling of 225054362413 in words is "two hundred twenty-five billion, fifty-four million, three hundred sixty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •