Base | Representation |
---|---|
bin | 100101110101011010111… |
… | …0101001110000111100001 |
3 | 200102010000020010020101121 |
4 | 1023222311311032013201 |
5 | 1140144010012240323 |
6 | 15020455031532241 |
7 | 1044453611456014 |
oct | 113526565160741 |
9 | 20363006106347 |
10 | 5199961055713 |
11 | 17253224a92a6 |
12 | 6bb95452a081 |
13 | 2b947b2c9288 |
14 | 13d97260b37b |
15 | 903e2551a5d |
hex | 4bab5d4e1e1 |
5199961055713 has 8 divisors (see below), whose sum is σ = 5474358972000. Its totient is φ = 4925634715008.
The previous prime is 5199961055669. The next prime is 5199961055743. The reversal of 5199961055713 is 3175501699915.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5199961055713 is a prime.
It is a super-3 number, since 3×51999610557133 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5199961055743) 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 7 ways as a sum of consecutive naturals, for example, 17744731 + ... + 18035392.
It is an arithmetic number, because the mean of its divisors is an integer number (684294871500).
Almost surely, 25199961055713 is an apocalyptic number.
It is an amenable number.
5199961055713 is a deficient number, since it is larger than the sum of its proper divisors (274397916287).
5199961055713 is a wasteful number, since it uses less digits than its factorization.
5199961055713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35787791.
The product of its (nonzero) digits is 11481750, while the sum is 61.
The spelling of 5199961055713 in words is "five trillion, one hundred ninety-nine billion, nine hundred sixty-one million, fifty-five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •