Base | Representation |
---|---|
bin | 1101001011101000010… |
… | …1001101010000010101 |
3 | 210122112101212110121022 |
4 | 3102322011031100111 |
5 | 12202242304222311 |
6 | 252011232330525 |
7 | 22234616110511 |
oct | 3227205152025 |
9 | 718471773538 |
10 | 226460226581 |
11 | 8804a992056 |
12 | 37a810a3a45 |
13 | 18480230294 |
14 | ad64377141 |
15 | 5d564365db |
hex | 34ba14d415 |
226460226581 has 2 divisors, whose sum is σ = 226460226582. Its totient is φ = 226460226580.
The previous prime is 226460226533. The next prime is 226460226593. The reversal of 226460226581 is 185622064622.
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., 171362053681 + 55098172900 = 413959^2 + 234730^2 .
It is a cyclic number.
It is not a de Polignac number, because 226460226581 - 210 = 226460225557 is a prime.
It is a super-2 number, since 2×2264602265812 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (226460226511) 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, 113230113290 + 113230113291.
It is an arithmetic number, because the mean of its divisors is an integer number (113230113291).
Almost surely, 2226460226581 is an apocalyptic number.
It is an amenable number.
226460226581 is a deficient number, since it is larger than the sum of its proper divisors (1).
226460226581 is an equidigital number, since it uses as much as digits as its factorization.
226460226581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 552960, while the sum is 44.
The spelling of 226460226581 in words is "two hundred twenty-six billion, four hundred sixty million, two hundred twenty-six thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •