Base | Representation |
---|---|
bin | 111101011011100000010… |
… | …111111101010100100001 |
3 | 112221120020011202000201112 |
4 | 331123200113331110201 |
5 | 1023130433044332122 |
6 | 12551143345313105 |
7 | 613662531115115 |
oct | 75334027752441 |
9 | 15846204660645 |
10 | 4221422261537 |
11 | 13883278a5a48 |
12 | 582181935795 |
13 | 2481033668c0 |
14 | 108464571745 |
15 | 74c1ee8b2e2 |
hex | 3d6e05fd521 |
4221422261537 has 32 divisors (see below), whose sum is σ = 4898173980672. Its totient is φ = 3603303880704.
The previous prime is 4221422261527. The next prime is 4221422261579. The reversal of 4221422261537 is 7351622241224.
4221422261537 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 4221422261537 - 210 = 4221422260513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4221422261494 and 4221422261503.
It is not an unprimeable number, because it can be changed into a prime (4221422261527) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 5298893 + ... + 6043269.
It is an arithmetic number, because the mean of its divisors is an integer number (153067936896).
Almost surely, 24221422261537 is an apocalyptic number.
It is an amenable number.
4221422261537 is a deficient number, since it is larger than the sum of its proper divisors (676751719135).
4221422261537 is a wasteful number, since it uses less digits than its factorization.
4221422261537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744857.
The product of its digits is 322560, while the sum is 41.
The spelling of 4221422261537 in words is "four trillion, two hundred twenty-one billion, four hundred twenty-two million, two hundred sixty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •