Base | Representation |
---|---|
bin | 11011000000111… |
… | …10000110010110 |
3 | 120210102021022011 |
4 | 31200132012112 |
5 | 431003200302 |
6 | 34253054434 |
7 | 5421126115 |
oct | 1540360626 |
9 | 523367264 |
10 | 226615702 |
11 | 106a11805 |
12 | 63a8741a |
13 | 37c45a41 |
14 | 2214dc7c |
15 | 14d655d7 |
hex | d81e196 |
226615702 has 4 divisors (see below), whose sum is σ = 339923556. Its totient is φ = 113307850.
The previous prime is 226615699. The next prime is 226615709. The reversal of 226615702 is 207516622.
226615702 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 207516622 = 2 ⋅103758311.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226615709) 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 as a sum of consecutive naturals, namely, 56653924 + ... + 56653927.
It is an arithmetic number, because the mean of its divisors is an integer number (84980889).
Almost surely, 2226615702 is an apocalyptic number.
226615702 is a deficient number, since it is larger than the sum of its proper divisors (113307854).
226615702 is a wasteful number, since it uses less digits than its factorization.
226615702 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113307853.
The product of its (nonzero) digits is 10080, while the sum is 31.
The square root of 226615702 is about 15053.7603940012. The cubic root of 226615702 is about 609.6725843028.
The spelling of 226615702 in words is "two hundred twenty-six million, six hundred fifteen thousand, seven hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •