Base | Representation |
---|---|
bin | 100010100100111… |
… | …101001111111111 |
3 | 1111102120210222202 |
4 | 202210331033333 |
5 | 2142002112112 |
6 | 133321502115 |
7 | 20242611506 |
oct | 4244751777 |
9 | 1442523882 |
10 | 580113407 |
11 | 278505875 |
12 | 14234193b |
13 | 93254c93 |
14 | 5708b83d |
15 | 35de06c2 |
hex | 2293d3ff |
580113407 has 8 divisors (see below), whose sum is σ = 593777184. Its totient is φ = 566604288.
The previous prime is 580113379. The next prime is 580113409. The reversal of 580113407 is 704311085.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-580113407 is a prime.
It is a super-2 number, since 2×5801134072 = 673063129962295298, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 580113407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (580113409) 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, 31058 + ... + 46095.
It is an arithmetic number, because the mean of its divisors is an integer number (74222148).
Almost surely, 2580113407 is an apocalyptic number.
580113407 is a deficient number, since it is larger than the sum of its proper divisors (13663777).
580113407 is a wasteful number, since it uses less digits than its factorization.
580113407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77329.
The product of its (nonzero) digits is 3360, while the sum is 29.
The square root of 580113407 is about 24085.5435271866. The cubic root of 580113407 is about 834.0094422193.
The spelling of 580113407 in words is "five hundred eighty million, one hundred thirteen thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •