Base | Representation |
---|---|
bin | 100001000111000100011… |
… | …1001110010011101001001 |
3 | 121010001001211012201001122 |
4 | 1002032020321302131021 |
5 | 1044024231301413323 |
6 | 13402314143325025 |
7 | 646526530056452 |
oct | 102161071623511 |
9 | 17101054181048 |
10 | 4550667216713 |
11 | 14a4a2200a992 |
12 | 615b492b0775 |
13 | 270183cb77c7 |
14 | 11a379736129 |
15 | 7d58ed2bec8 |
hex | 42388e72749 |
4550667216713 has 4 divisors (see below), whose sum is σ = 4707586775940. Its totient is φ = 4393747657488.
The previous prime is 4550667216703. The next prime is 4550667216727. The reversal of 4550667216713 is 3176127660554.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 949371563449 + 3601295653264 = 974357^2 + 1897708^2 .
It is a cyclic number.
It is not a de Polignac number, because 4550667216713 - 28 = 4550667216457 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4550667216703) 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, 78459779570 + ... + 78459779627.
It is an arithmetic number, because the mean of its divisors is an integer number (1176896693985).
Almost surely, 24550667216713 is an apocalyptic number.
It is an amenable number.
4550667216713 is a deficient number, since it is larger than the sum of its proper divisors (156919559227).
4550667216713 is a wasteful number, since it uses less digits than its factorization.
4550667216713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156919559226.
The product of its (nonzero) digits is 6350400, while the sum is 53.
The spelling of 4550667216713 in words is "four trillion, five hundred fifty billion, six hundred sixty-seven million, two hundred sixteen thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •