Base | Representation |
---|---|
bin | 111101100000000100001… |
… | …101101001101000000101 |
3 | 112222000212101220001010121 |
4 | 331200010031221220011 |
5 | 1023221000014202001 |
6 | 12553313253021541 |
7 | 614225053400560 |
oct | 75400415515005 |
9 | 15860771801117 |
10 | 4226318506501 |
11 | 138a40a687293 |
12 | 5831096248b1 |
13 | 248703868780 |
14 | 1087aa9454d7 |
15 | 74e09c4a6a1 |
hex | 3d804369a05 |
4226318506501 has 8 divisors (see below), whose sum is σ = 5201622777344. Its totient is φ = 3343900356720.
The previous prime is 4226318506471. The next prime is 4226318506517. The reversal of 4226318506501 is 1056058136224.
4226318506501 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4226318506501 - 27 = 4226318506373 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4226318506001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23221530165 + ... + 23221530346.
It is an arithmetic number, because the mean of its divisors is an integer number (650202847168).
Almost surely, 24226318506501 is an apocalyptic number.
It is an amenable number.
4226318506501 is a deficient number, since it is larger than the sum of its proper divisors (975304270843).
4226318506501 is a wasteful number, since it uses less digits than its factorization.
4226318506501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46443060531.
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 4226318506501 in words is "four trillion, two hundred twenty-six billion, three hundred eighteen million, five hundred six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •