Base | Representation |
---|---|
bin | 100101001010011001000… |
… | …0000001010001111001001 |
3 | 200002021111021212010120021 |
4 | 1022110302000022033021 |
5 | 1132140233041031143 |
6 | 14510213421500441 |
7 | 1035002655220213 |
oct | 112246200121711 |
9 | 20067437763507 |
10 | 5107555017673 |
11 | 169a113721219 |
12 | 6a5a65a11721 |
13 | 2b0842b85c64 |
14 | 1392c7d5b5b3 |
15 | 8ccd4d59ced |
hex | 4a53200a3c9 |
5107555017673 has 4 divisors (see below), whose sum is σ = 5107839912340. Its totient is φ = 5107270123008.
The previous prime is 5107555017623. The next prime is 5107555017683. The reversal of 5107555017673 is 3767105557015.
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 1088460283849 + 4019094733824 = 1043293^2 + 2004768^2 .
It is a cyclic number.
It is not a de Polignac number, because 5107555017673 - 29 = 5107555017161 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5107555017673.
It is not an unprimeable number, because it can be changed into a prime (5107555017623) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 142420440 + ... + 142456297.
It is an arithmetic number, because the mean of its divisors is an integer number (1276959978085).
Almost surely, 25107555017673 is an apocalyptic number.
It is an amenable number.
5107555017673 is a deficient number, since it is larger than the sum of its proper divisors (284894667).
5107555017673 is a wasteful number, since it uses less digits than its factorization.
5107555017673 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284894666.
The product of its (nonzero) digits is 3858750, while the sum is 52.
The spelling of 5107555017673 in words is "five trillion, one hundred seven billion, five hundred fifty-five million, seventeen thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •