Base | Representation |
---|---|
bin | 111010101101011001110110… |
… | …0110110101010010110110101 |
3 | 2111201110122220222112200020011 |
4 | 1311122303230312222112311 |
5 | 1020141410134324212401 |
6 | 5030153054440340221 |
7 | 213526440642250243 |
oct | 16532635466522665 |
9 | 2451418828480204 |
10 | 516413661554101 |
11 | 13a5aa893086413 |
12 | 49b04516474671 |
13 | 1921c7a395a04c |
14 | 91747a9ab3793 |
15 | 3ea8187750451 |
hex | 1d5acecdaa5b5 |
516413661554101 has 8 divisors (see below), whose sum is σ = 516662291376000. Its totient is φ = 516165034213920.
The previous prime is 516413661554083. The next prime is 516413661554221. The reversal of 516413661554101 is 101455166314615.
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 516413661554101 - 217 = 516413661423029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (516413661504101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 520961505 + ... + 521951833.
It is an arithmetic number, because the mean of its divisors is an integer number (64582786422000).
Almost surely, 2516413661554101 is an apocalyptic number.
It is an amenable number.
516413661554101 is a deficient number, since it is larger than the sum of its proper divisors (248629821899).
516413661554101 is a wasteful number, since it uses less digits than its factorization.
516413661554101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1240859.
The product of its (nonzero) digits is 1296000, while the sum is 49.
The spelling of 516413661554101 in words is "five hundred sixteen trillion, four hundred thirteen billion, six hundred sixty-one million, five hundred fifty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •