Base | Representation |
---|---|
bin | 100001001001101100110… |
… | …0001100001010110110101 |
3 | 121010120122102002111100122 |
4 | 1002103121201201112311 |
5 | 1044122313040331023 |
6 | 13405050410221325 |
7 | 650116504410026 |
oct | 102233141412665 |
9 | 17116572074318 |
10 | 4556314777013 |
11 | 14a735a9aa59a |
12 | 617064724845 |
13 | 270874054a6c |
14 | 11a753800c4d |
15 | 7d7c0a482c8 |
hex | 424d98615b5 |
4556314777013 has 4 divisors (see below), whose sum is σ = 4565670660000. Its totient is φ = 4546958894028.
The previous prime is 4556314776943. The next prime is 4556314777037. The reversal of 4556314777013 is 3107774136554.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4556314777013 - 28 = 4556314776757 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4556314777213) 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 3 ways as a sum of consecutive naturals, for example, 4677940763 + ... + 4677941736.
It is an arithmetic number, because the mean of its divisors is an integer number (1141417665000).
Almost surely, 24556314777013 is an apocalyptic number.
It is an amenable number.
4556314777013 is a deficient number, since it is larger than the sum of its proper divisors (9355882987).
4556314777013 is an equidigital number, since it uses as much as digits as its factorization.
4556314777013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9355882986.
The product of its (nonzero) digits is 7408800, while the sum is 53.
The spelling of 4556314777013 in words is "four trillion, five hundred fifty-six billion, three hundred fourteen million, seven hundred seventy-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •