Base | Representation |
---|---|
bin | 100000011010011000100… |
… | …101100101000000001101 |
3 | 21212221012001201022000021 |
4 | 200122120211211000031 |
5 | 242443104340001203 |
6 | 4423122025502141 |
7 | 316630612342651 |
oct | 40323045450015 |
9 | 7787161638007 |
10 | 2227353047053 |
11 | 7896848010a2 |
12 | 2bb814041951 |
13 | 132066746194 |
14 | 79b39634a61 |
15 | 3ce129c35bd |
hex | 2069896500d |
2227353047053 has 8 divisors (see below), whose sum is σ = 2279280502400. Its totient is φ = 2175431434848.
The previous prime is 2227353047039. The next prime is 2227353047057. The reversal of 2227353047053 is 3507403537222.
It is a happy number.
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 2227353047053 - 217 = 2227352915981 is a prime.
It is a super-2 number, since 2×22273530470532 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2227353047057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 684768 + ... + 2218921.
It is an arithmetic number, because the mean of its divisors is an integer number (284910062800).
Almost surely, 22227353047053 is an apocalyptic number.
It is an amenable number.
2227353047053 is a deficient number, since it is larger than the sum of its proper divisors (51927455347).
2227353047053 is a wasteful number, since it uses less digits than its factorization.
2227353047053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2921571.
The product of its (nonzero) digits is 1058400, while the sum is 43.
The spelling of 2227353047053 in words is "two trillion, two hundred twenty-seven billion, three hundred fifty-three million, forty-seven thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •