Base | Representation |
---|---|
bin | 1000010010110101… |
… | …0100100010011001 |
3 | 12202011111112221011 |
4 | 2010231110202121 |
5 | 14024434114423 |
6 | 1004533013521 |
7 | 106113465154 |
oct | 20455244231 |
9 | 5664445834 |
10 | 2226473113 |
11 | a42871227 |
12 | 5217842a1 |
13 | 296370217 |
14 | 1719acc9b |
15 | d06eab0d |
hex | 84b54899 |
2226473113 has 8 divisors (see below), whose sum is σ = 2290071368. Its totient is φ = 2163055104.
The previous prime is 2226473111. The next prime is 2226473129. The reversal of 2226473113 is 3113746222.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 520204864 + 1706268249 = 22808^2 + 41307^2 .
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 2226473113 - 21 = 2226473111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2226473111) 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, 19806 + ... + 69607.
It is an arithmetic number, because the mean of its divisors is an integer number (286258921).
Almost surely, 22226473113 is an apocalyptic number.
It is an amenable number.
2226473113 is a deficient number, since it is larger than the sum of its proper divisors (63598255).
2226473113 is an equidigital number, since it uses as much as digits as its factorization.
2226473113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90123.
The product of its digits is 12096, while the sum is 31.
The square root of 2226473113 is about 47185.5180431454. The cubic root of 2226473113 is about 1305.7874341258.
The spelling of 2226473113 in words is "two billion, two hundred twenty-six million, four hundred seventy-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •