Base | Representation |
---|---|
bin | 11010111101000… |
… | …11110000111101 |
3 | 120202110210221121 |
4 | 31132203300331 |
5 | 430341131441 |
6 | 34234230541 |
7 | 5413641205 |
oct | 1536436075 |
9 | 522423847 |
10 | 226114621 |
11 | 1066aa297 |
12 | 63885451 |
13 | 37acb945 |
14 | 2205d405 |
15 | 14cb6dd1 |
hex | d7a3c3d |
226114621 has 2 divisors, whose sum is σ = 226114622. Its totient is φ = 226114620.
The previous prime is 226114619. The next prime is 226114627. The reversal of 226114621 is 126411622.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 207504025 + 18610596 = 14405^2 + 4314^2 .
It is a cyclic number.
It is not a de Polignac number, because 226114621 - 21 = 226114619 is a prime.
It is a super-2 number, since 2×2261146212 = 102255643659947282, which contains 22 as substring.
Together with 226114619, 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 (226114627) 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, 113057310 + 113057311.
It is an arithmetic number, because the mean of its divisors is an integer number (113057311).
Almost surely, 2226114621 is an apocalyptic number.
It is an amenable number.
226114621 is a deficient number, since it is larger than the sum of its proper divisors (1).
226114621 is an equidigital number, since it uses as much as digits as its factorization.
226114621 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1152, while the sum is 25.
The square root of 226114621 is about 15037.1081328825. The cubic root of 226114621 is about 609.2228937948. Note that the first 3 decimals are identical.
The spelling of 226114621 in words is "two hundred twenty-six million, one hundred fourteen thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •