Base | Representation |
---|---|
bin | 11010111101000… |
… | …01010101000010 |
3 | 120202110022021000 |
4 | 31132201111002 |
5 | 430340322032 |
6 | 34234112430 |
7 | 5413600131 |
oct | 1536412502 |
9 | 522408230 |
10 | 226104642 |
11 | 1066a2845 |
12 | 6387b716 |
13 | 37ac723a |
14 | 22059918 |
15 | 14cb3e7c |
hex | d7a1542 |
226104642 has 16 divisors (see below), whose sum is σ = 502454880. Its totient is φ = 75368196.
The previous prime is 226104631. The next prime is 226104643. The reversal of 226104642 is 246401622.
226104642 is a `hidden beast` number, since 2 + 2 + 6 + 10 + 4 + 642 = 666.
It is a super-3 number, since 3×2261046423 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (226104643) 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, 2093508 + ... + 2093615.
It is an arithmetic number, because the mean of its divisors is an integer number (31403430).
Almost surely, 2226104642 is an apocalyptic number.
226104642 is an abundant number, since it is smaller than the sum of its proper divisors (276350238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226104642 is a wasteful number, since it uses less digits than its factorization.
226104642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4187134 (or 4187128 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 226104642 is about 15036.7763167509. The cubic root of 226104642 is about 609.2139314897.
The spelling of 226104642 in words is "two hundred twenty-six million, one hundred four thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •