Base | Representation |
---|---|
bin | 110001011111001… |
… | …100010000010001 |
3 | 2010212021120221022 |
4 | 301133030100101 |
5 | 3200021311431 |
6 | 214215205225 |
7 | 26401044536 |
oct | 6137142021 |
9 | 2125246838 |
10 | 830260241 |
11 | 396729898 |
12 | 1b2076815 |
13 | 103019465 |
14 | 7c3a4d8d |
15 | 4cd5307b |
hex | 317cc411 |
830260241 has 4 divisors (see below), whose sum is σ = 830394084. Its totient is φ = 830126400.
The previous prime is 830260231. The next prime is 830260253. The reversal of 830260241 is 142062038.
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 784224016 + 46036225 = 28004^2 + 6785^2 .
It is a cyclic number.
It is not a de Polignac number, because 830260241 - 26 = 830260177 is a prime.
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 830260241.
It is not an unprimeable number, because it can be changed into a prime (830260231) 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, 57140 + ... + 70181.
It is an arithmetic number, because the mean of its divisors is an integer number (207598521).
Almost surely, 2830260241 is an apocalyptic number.
It is an amenable number.
830260241 is a deficient number, since it is larger than the sum of its proper divisors (133843).
830260241 is a wasteful number, since it uses less digits than its factorization.
830260241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133842.
The product of its (nonzero) digits is 2304, while the sum is 26.
The square root of 830260241 is about 28814.2367762882. The cubic root of 830260241 is about 939.8778477909.
The spelling of 830260241 in words is "eight hundred thirty million, two hundred sixty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •