Base | Representation |
---|---|
bin | 1111000010010110110… |
… | …11110010001011100101 |
3 | 1211101121001001020102012 |
4 | 13201023123302023211 |
5 | 31431110340301044 |
6 | 1033203500124005 |
7 | 52220233365011 |
oct | 7411333621345 |
9 | 1741531036365 |
10 | 516661650149 |
11 | 18a12a0398a7 |
12 | 84170b36605 |
13 | 3994b006968 |
14 | 1b013dc9541 |
15 | d68d77359e |
hex | 784b6f22e5 |
516661650149 has 4 divisors (see below), whose sum is σ = 527654451264. Its totient is φ = 505668849036.
The previous prime is 516661650091. The next prime is 516661650163. The reversal of 516661650149 is 941056166615.
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 516661650149 - 216 = 516661584613 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 516661650097 and 516661650106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (516661650179) 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, 5496400487 + ... + 5496400580.
It is an arithmetic number, because the mean of its divisors is an integer number (131913612816).
Almost surely, 2516661650149 is an apocalyptic number.
It is an amenable number.
516661650149 is a deficient number, since it is larger than the sum of its proper divisors (10992801115).
516661650149 is a wasteful number, since it uses less digits than its factorization.
516661650149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10992801114.
The product of its (nonzero) digits is 1166400, while the sum is 50.
The spelling of 516661650149 in words is "five hundred sixteen billion, six hundred sixty-one million, six hundred fifty thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •