Base | Representation |
---|---|
bin | 11010111100110… |
… | …10011101010110 |
3 | 120202101212122210 |
4 | 31132122131112 |
5 | 430333422002 |
6 | 34233334250 |
7 | 5413422111 |
oct | 1536323526 |
9 | 522355583 |
10 | 226076502 |
11 | 106683693 |
12 | 63867386 |
13 | 37ab74a2 |
14 | 2204d578 |
15 | 14caa96c |
hex | d79a756 |
226076502 has 8 divisors (see below), whose sum is σ = 452153016. Its totient is φ = 75358832.
The previous prime is 226076491. The next prime is 226076503. The reversal of 226076502 is 205670622.
It is a sphenic number, since it is the product of 3 distinct primes.
226076502 is an admirable number.
It is a super-2 number, since 2×2260765022 = 102221169513112008, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 226076502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226076503) 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, 18839703 + ... + 18839714.
It is an arithmetic number, because the mean of its divisors is an integer number (56519127).
Almost surely, 2226076502 is an apocalyptic number.
226076502 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226076502 is a wasteful number, since it uses less digits than its factorization.
226076502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37679422.
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 226076502 is about 15035.8405817566. The cubic root of 226076502 is about 609.1886570694.
The spelling of 226076502 in words is "two hundred twenty-six million, seventy-six thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •