Base | Representation |
---|---|
bin | 110001100000000… |
… | …110110011011001 |
3 | 2010212201202220101 |
4 | 301200012303121 |
5 | 3200102000212 |
6 | 214224255401 |
7 | 26403063652 |
oct | 6140066331 |
9 | 2125652811 |
10 | 830500057 |
11 | 396882a92 |
12 | 1b2171561 |
13 | 1030a166a |
14 | 7c428529 |
15 | 4cd9e157 |
hex | 31806cd9 |
830500057 has 4 divisors (see below), whose sum is σ = 859138020. Its totient is φ = 801862096.
The previous prime is 830500043. The next prime is 830500067. The reversal of 830500057 is 750005038.
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 691637401 + 138862656 = 26299^2 + 11784^2 .
It is a cyclic number.
It is not a de Polignac number, because 830500057 - 227 = 696282329 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 830499998 and 830500034.
It is not an unprimeable number, because it can be changed into a prime (830500067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14318938 + ... + 14318995.
It is an arithmetic number, because the mean of its divisors is an integer number (214784505).
Almost surely, 2830500057 is an apocalyptic number.
It is an amenable number.
830500057 is a deficient number, since it is larger than the sum of its proper divisors (28637963).
830500057 is a wasteful number, since it uses less digits than its factorization.
830500057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28637962.
The product of its (nonzero) digits is 4200, while the sum is 28.
The square root of 830500057 is about 28818.3978909307. The cubic root of 830500057 is about 939.9683318892.
The spelling of 830500057 in words is "eight hundred thirty million, five hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •