Base | Representation |
---|---|
bin | 11011000001011… |
… | …00001010010111 |
3 | 120210112012022112 |
4 | 31200230022113 |
5 | 431012021203 |
6 | 34254221235 |
7 | 5421456053 |
oct | 1540541227 |
9 | 523465275 |
10 | 226673303 |
11 | 106a5100a |
12 | 63ab481b |
13 | 37c6601c |
14 | 22166c63 |
15 | 14d776d8 |
hex | d82c297 |
226673303 has 8 divisors (see below), whose sum is σ = 238039008. Its totient is φ = 215433504.
The previous prime is 226673281. The next prime is 226673311. The reversal of 226673303 is 303376622.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 226673303 - 28 = 226673047 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 226673303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226673323) 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, 27776 + ... + 34997.
It is an arithmetic number, because the mean of its divisors is an integer number (29754876).
Almost surely, 2226673303 is an apocalyptic number.
226673303 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
226673303 is a deficient number, since it is larger than the sum of its proper divisors (11365705).
226673303 is a wasteful number, since it uses less digits than its factorization.
226673303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62953.
The product of its (nonzero) digits is 27216, while the sum is 32.
The square root of 226673303 is about 15055.6734489029. The cubic root of 226673303 is about 609.7242352920.
The spelling of 226673303 in words is "two hundred twenty-six million, six hundred seventy-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •