Base | Representation |
---|---|
bin | 11011000010000… |
… | …10010001101111 |
3 | 120210200210120111 |
4 | 31201002101233 |
5 | 431022421022 |
6 | 34300200451 |
7 | 5422314130 |
oct | 1541022157 |
9 | 523623514 |
10 | 226763887 |
11 | 107003079 |
12 | 63b39127 |
13 | 37c9831c |
14 | 2218bc87 |
15 | 14d94477 |
hex | d84246f |
226763887 has 8 divisors (see below), whose sum is σ = 261725472. Its totient is φ = 192444000.
The previous prime is 226763881. The next prime is 226763893. The reversal of 226763887 is 788367622.
It is an interprime number because it is at equal distance from previous prime (226763881) and next prime (226763893).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-226763887 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 226763887.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226763881) 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 in 7 ways as a sum of consecutive naturals, for example, 159664 + ... + 161077.
It is an arithmetic number, because the mean of its divisors is an integer number (32715684).
Almost surely, 2226763887 is an apocalyptic number.
226763887 is a deficient number, since it is larger than the sum of its proper divisors (34961585).
226763887 is a wasteful number, since it uses less digits than its factorization.
226763887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320849.
The product of its digits is 1354752, while the sum is 49.
The square root of 226763887 is about 15058.6814495825. The cubic root of 226763887 is about 609.8054445387.
The spelling of 226763887 in words is "two hundred twenty-six million, seven hundred sixty-three thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •