Base | Representation |
---|---|
bin | 11011000001001… |
… | …10101110100001 |
3 | 120210111001210000 |
4 | 31200212232201 |
5 | 431010313131 |
6 | 34253530213 |
7 | 5421334131 |
oct | 1540465641 |
9 | 523431700 |
10 | 226651041 |
11 | 106a36311 |
12 | 63aa3969 |
13 | 37c58b56 |
14 | 2215cac1 |
15 | 14d70ce6 |
hex | d826ba1 |
226651041 has 10 divisors (see below), whose sum is σ = 338577602. Its totient is φ = 151100640.
The previous prime is 226650989. The next prime is 226651043. The reversal of 226651041 is 140156622.
226651041 is a `hidden beast` number, since 2 + 2 + 6 + 651 + 0 + 4 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 199402641 + 27248400 = 14121^2 + 5220^2 .
It is not a de Polignac number, because 226651041 - 225 = 193096609 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 226650996 and 226651014.
It is not an unprimeable number, because it can be changed into a prime (226651043) 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 9 ways as a sum of consecutive naturals, for example, 1399000 + ... + 1399161.
Almost surely, 2226651041 is an apocalyptic number.
It is an amenable number.
226651041 is a deficient number, since it is larger than the sum of its proper divisors (111926561).
226651041 is an equidigital number, since it uses as much as digits as its factorization.
226651041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2798173 (or 2798164 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 226651041 is about 15054.9341081255. The cubic root of 226651041 is about 609.7042739274.
The spelling of 226651041 in words is "two hundred twenty-six million, six hundred fifty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •