Base | Representation |
---|---|
bin | 100100110110010110000… |
… | …0011000100100010010101 |
3 | 122221011101002111020010021 |
4 | 1021230230003010202111 |
5 | 1130434101343211001 |
6 | 14434333544025141 |
7 | 1031620110664426 |
oct | 111545403044225 |
9 | 18834332436107 |
10 | 5064505444501 |
11 | 1682932323778 |
12 | 6996507621b1 |
13 | 2a9772083139 |
14 | 1371a276164d |
15 | 8bb1578aba1 |
hex | 49b2c0c4895 |
5064505444501 has 8 divisors (see below), whose sum is σ = 5227968593408. Its totient is φ = 4901048046000.
The previous prime is 5064505444463. The next prime is 5064505444519. The reversal of 5064505444501 is 1054445054605.
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 5064505444501 - 211 = 5064505442453 is a prime.
It is a super-2 number, since 2×50645054445012 (a number of 26 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 (5064505444571) 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, 389131 + ... + 3206311.
It is an arithmetic number, because the mean of its divisors is an integer number (653496074176).
Almost surely, 25064505444501 is an apocalyptic number.
It is an amenable number.
5064505444501 is a deficient number, since it is larger than the sum of its proper divisors (163463148907).
5064505444501 is a wasteful number, since it uses less digits than its factorization.
5064505444501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2875203.
The product of its (nonzero) digits is 960000, while the sum is 43.
The spelling of 5064505444501 in words is "five trillion, sixty-four billion, five hundred five million, four hundred forty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •