Base | Representation |
---|---|
bin | 1110110000010001000… |
… | …11100111101000010001 |
3 | 1210110112012021211221022 |
4 | 13120020203213220101 |
5 | 31301213110233032 |
6 | 1024520043205225 |
7 | 51424454213642 |
oct | 7301043475021 |
9 | 1713465254838 |
10 | 506949696017 |
11 | 185aa5983a26 |
12 | 82300516815 |
13 | 38a60bc013b |
14 | 1a7722076c9 |
15 | d2c0d12512 |
hex | 76088e7a11 |
506949696017 has 4 divisors (see below), whose sum is σ = 507134649396. Its totient is φ = 506764742640.
The previous prime is 506949695977. The next prime is 506949696041. The reversal of 506949696017 is 710696949605.
It is a Cunningham number, because it is equal to 7120042+1.
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 150004388416 + 356945307601 = 387304^2 + 597449^2 .
It is a cyclic number.
It is not a de Polignac number, because 506949696017 - 214 = 506949679633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (506949696047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 92472578 + ... + 92478059.
It is an arithmetic number, because the mean of its divisors is an integer number (126783662349).
Almost surely, 2506949696017 is an apocalyptic number.
It is an amenable number.
506949696017 is a deficient number, since it is larger than the sum of its proper divisors (184953379).
506949696017 is a wasteful number, since it uses less digits than its factorization.
506949696017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184953378.
The product of its (nonzero) digits is 22044960, while the sum is 62.
The spelling of 506949696017 in words is "five hundred six billion, nine hundred forty-nine million, six hundred ninety-six thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •