Base | Representation |
---|---|
bin | 1101001010010101001… |
… | …1111011111110110100 |
3 | 210121122010011212011121 |
4 | 3102211103323332310 |
5 | 12201034103011302 |
6 | 251512503513324 |
7 | 22223155205665 |
oct | 3224523737664 |
9 | 717563155147 |
10 | 226111766452 |
11 | 87991219880 |
12 | 379a4458844 |
13 | 18425c95c60 |
14 | ad2dd8b36c |
15 | 5d35a53e37 |
hex | 34a54fbfb4 |
226111766452 has 24 divisors (see below), whose sum is σ = 464873143392. Its totient is φ = 94872069600.
The previous prime is 226111766449. The next prime is 226111766513. The reversal of 226111766452 is 254667111622.
It is a super-2 number, since 2×2261117664522 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 226111766399 and 226111766408.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 197649574 + ... + 197650717.
It is an arithmetic number, because the mean of its divisors is an integer number (19369714308).
Almost surely, 2226111766452 is an apocalyptic number.
226111766452 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
226111766452 is an abundant number, since it is smaller than the sum of its proper divisors (238761376940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
226111766452 is a wasteful number, since it uses less digits than its factorization.
226111766452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 395300319 (or 395300317 counting only the distinct ones).
The product of its digits is 241920, while the sum is 43.
The spelling of 226111766452 in words is "two hundred twenty-six billion, one hundred eleven million, seven hundred sixty-six thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •