Base | Representation |
---|---|
bin | 1101001100010010100… |
… | …1011001111000110101 |
3 | 210122222202102021002210 |
4 | 3103010221121320311 |
5 | 12203123144101134 |
6 | 252041003524033 |
7 | 22242200600625 |
oct | 3230451317065 |
9 | 718882367083 |
10 | 226637487669 |
11 | 88130a53a1a |
12 | 37b10529619 |
13 | 184aab855b8 |
14 | ad7db1a885 |
15 | 5d66c9d2e9 |
hex | 34c4a59e35 |
226637487669 has 32 divisors (see below), whose sum is σ = 314534133760. Its totient is φ = 144998683200.
The previous prime is 226637487667. The next prime is 226637487683. The reversal of 226637487669 is 966784736622.
226637487669 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 226637487669 - 21 = 226637487667 is a prime.
It is a super-2 number, since 2×2266374876692 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (226637487667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41820042 + ... + 41825460.
It is an arithmetic number, because the mean of its divisors is an integer number (9829191680).
Almost surely, 2226637487669 is an apocalyptic number.
It is an amenable number.
226637487669 is a deficient number, since it is larger than the sum of its proper divisors (87896646091).
226637487669 is a wasteful number, since it uses less digits than its factorization.
226637487669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9121.
The product of its digits is 219469824, while the sum is 66.
The spelling of 226637487669 in words is "two hundred twenty-six billion, six hundred thirty-seven million, four hundred eighty-seven thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •