Base | Representation |
---|---|
bin | 110001100000010… |
… | …100111101010111 |
3 | 2010212211201102212 |
4 | 301200110331113 |
5 | 3200110324124 |
6 | 214225424035 |
7 | 26403425003 |
oct | 6140247527 |
9 | 2125751385 |
10 | 830558039 |
11 | 396912603 |
12 | 1b219b01b |
13 | 1030c1b7c |
14 | 7c441703 |
15 | 4cdb140e |
hex | 31814f57 |
830558039 has 8 divisors (see below), whose sum is σ = 878094000. Its totient is φ = 783404352.
The previous prime is 830558021. The next prime is 830558087. The reversal of 830558039 is 930855038.
830558039 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-830558039 is a prime.
It is a super-2 number, since 2×8305580392 = 1379653312295051042, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 830557987 and 830558005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (830552039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91094 + ... + 99795.
It is an arithmetic number, because the mean of its divisors is an integer number (109761750).
Almost surely, 2830558039 is an apocalyptic number.
830558039 is a deficient number, since it is larger than the sum of its proper divisors (47535961).
830558039 is a wasteful number, since it uses less digits than its factorization.
830558039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191137.
The product of its (nonzero) digits is 129600, while the sum is 41.
The square root of 830558039 is about 28819.4038626756. The cubic root of 830558039 is about 939.9902062508.
The spelling of 830558039 in words is "eight hundred thirty million, five hundred fifty-eight thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •