Base | Representation |
---|---|
bin | 1101000111100010101… |
… | …1001001100010010001 |
3 | 210112200221000022100222 |
4 | 3101320223021202101 |
5 | 12143020344022221 |
6 | 251310312322425 |
7 | 22165462562354 |
oct | 3217053114221 |
9 | 715627008328 |
10 | 225362876561 |
11 | 87637517809 |
12 | 378156a3415 |
13 | 18336a99844 |
14 | ac9c72829b |
15 | 5cdee259ab |
hex | 3478ac9891 |
225362876561 has 2 divisors, whose sum is σ = 225362876562. Its totient is φ = 225362876560.
The previous prime is 225362876527. The next prime is 225362876569. The reversal of 225362876561 is 165678263522.
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., 112816046161 + 112546830400 = 335881^2 + 335480^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-225362876561 is a prime.
It is a super-2 number, since 2×2253628765612 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (225362876569) 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, 112681438280 + 112681438281.
It is an arithmetic number, because the mean of its divisors is an integer number (112681438281).
Almost surely, 2225362876561 is an apocalyptic number.
It is an amenable number.
225362876561 is a deficient number, since it is larger than the sum of its proper divisors (1).
225362876561 is an equidigital number, since it uses as much as digits as its factorization.
225362876561 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7257600, while the sum is 53.
The spelling of 225362876561 in words is "two hundred twenty-five billion, three hundred sixty-two million, eight hundred seventy-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •