Base | Representation |
---|---|
bin | 10111001111111… |
… | …100011100011101 |
3 | 1000011221212211202 |
4 | 113033330130131 |
5 | 1244323240314 |
6 | 102412125245 |
7 | 12444263441 |
oct | 2717743435 |
9 | 1004855752 |
10 | 390055709 |
11 | 1901a369a |
12 | aa766825 |
13 | 62a6c1c4 |
14 | 39b36821 |
15 | 2439c0de |
hex | 173fc71d |
390055709 has 8 divisors (see below), whose sum is σ = 405086880. Its totient is φ = 375295536.
The previous prime is 390055691. The next prime is 390055711. The reversal of 390055709 is 907550093.
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 390055709 - 28 = 390055453 is a prime.
It is a super-2 number, since 2×3900557092 = 304286912246985362, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (390055109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64814 + ... + 70575.
It is an arithmetic number, because the mean of its divisors is an integer number (50635860).
Almost surely, 2390055709 is an apocalyptic number.
It is an amenable number.
390055709 is a deficient number, since it is larger than the sum of its proper divisors (15031171).
390055709 is a wasteful number, since it uses less digits than its factorization.
390055709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135499.
The product of its (nonzero) digits is 42525, while the sum is 38.
The square root of 390055709 is about 19749.8280752011. The cubic root of 390055709 is about 730.6491436092.
The spelling of 390055709 in words is "three hundred ninety million, fifty-five thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •