Base | Representation |
---|---|
bin | 11010111100100… |
… | …00101000000111 |
3 | 120202022211102021 |
4 | 31132100220013 |
5 | 430331124411 |
6 | 34232424011 |
7 | 5413163521 |
oct | 1536205007 |
9 | 522284367 |
10 | 226036231 |
11 | 106656403 |
12 | 63848007 |
13 | 37aa2065 |
14 | 2203ca11 |
15 | 14c9da71 |
hex | d790a07 |
226036231 has 2 divisors, whose sum is σ = 226036232. Its totient is φ = 226036230.
The previous prime is 226036229. The next prime is 226036247. The reversal of 226036231 is 132630622.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 226036231 - 21 = 226036229 is a prime.
It is a super-2 number, since 2×2260362312 = 102184755449370722, which contains 22 as substring.
Together with 226036229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 226036196 and 226036205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (226036201) 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, 113018115 + 113018116.
It is an arithmetic number, because the mean of its divisors is an integer number (113018116).
Almost surely, 2226036231 is an apocalyptic number.
226036231 is a deficient number, since it is larger than the sum of its proper divisors (1).
226036231 is an equidigital number, since it uses as much as digits as its factorization.
226036231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
The square root of 226036231 is about 15034.5013552163. The cubic root of 226036231 is about 609.1524833361.
Adding to 226036231 its reverse (132630622), we get a palindrome (358666853).
The spelling of 226036231 in words is "two hundred twenty-six million, thirty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •