Base | Representation |
---|---|
bin | 1101101100100011111… |
… | …00111110011100101001 |
3 | 1122222200221010212021021 |
4 | 12312101330332130221 |
5 | 30202242112203014 |
6 | 1000105105412441 |
7 | 45666623662012 |
oct | 6662174763451 |
9 | 1588627125237 |
10 | 470600116009 |
11 | 171642551511 |
12 | 7725703a121 |
13 | 354ba1c230a |
14 | 18ac4792009 |
15 | c394a4b624 |
hex | 6d91f3e729 |
470600116009 has 3 divisors (see below), whose sum is σ = 470600802013. Its totient is φ = 470599430006.
The previous prime is 470600116001. The next prime is 470600116031. The reversal of 470600116009 is 900611006074.
The square root of 470600116009 is 686003.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 470600116009 - 23 = 470600116001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (470600116001) 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 2 ways as a sum of consecutive naturals, for example, 343002 + ... + 1029004.
Almost surely, 2470600116009 is an apocalyptic number.
470600116009 is the 686003-rd square number.
470600116009 is the 343002-nd centered octagonal number.
It is an amenable number.
470600116009 is a deficient number, since it is larger than the sum of its proper divisors (686004).
470600116009 is an frugal number, since it uses more digits than its factorization.
470600116009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1372006 (or 686003 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 34.
The spelling of 470600116009 in words is "four hundred seventy billion, six hundred million, one hundred sixteen thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •