Base | Representation |
---|---|
bin | 11010111111101… |
… | …11001000001101 |
3 | 120210010011100010 |
4 | 31133313020031 |
5 | 430433043302 |
6 | 34245423433 |
7 | 5416562541 |
oct | 1537671015 |
9 | 523104303 |
10 | 226456077 |
11 | 106912891 |
12 | 63a0ab79 |
13 | 37bbb1a3 |
14 | 2210ba21 |
15 | 14d3316c |
hex | d7f720d |
226456077 has 4 divisors (see below), whose sum is σ = 301941440. Its totient is φ = 150970716.
The previous prime is 226456073. The next prime is 226456081. The reversal of 226456077 is 770654622.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (226456073) and next prime (226456081).
It is not a de Polignac number, because 226456077 - 22 = 226456073 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226456073) 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 in 3 ways as a sum of consecutive naturals, for example, 37742677 + ... + 37742682.
It is an arithmetic number, because the mean of its divisors is an integer number (75485360).
Almost surely, 2226456077 is an apocalyptic number.
It is an amenable number.
226456077 is a deficient number, since it is larger than the sum of its proper divisors (75485363).
226456077 is an equidigital number, since it uses as much as digits as its factorization.
226456077 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75485362.
The product of its (nonzero) digits is 141120, while the sum is 39.
The square root of 226456077 is about 15048.4576286077. The cubic root of 226456077 is about 609.5294023367.
The spelling of 226456077 in words is "two hundred twenty-six million, four hundred fifty-six thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •