Base | Representation |
---|---|
bin | 11001011100010… |
… | …101101001000001 |
3 | 1002202012200120022 |
4 | 121130111221001 |
5 | 1333233442243 |
6 | 110205023225 |
7 | 13402146044 |
oct | 3134255101 |
9 | 1082180508 |
10 | 426859073 |
11 | 1a9a505a3 |
12 | bab54b15 |
13 | 6a586a44 |
14 | 40996c5b |
15 | 2771bb68 |
hex | 19715a41 |
426859073 has 8 divisors (see below), whose sum is σ = 453959520. Its totient is φ = 400222080.
The previous prime is 426859067. The next prime is 426859079. The reversal of 426859073 is 370958624.
It is an interprime number because it is at equal distance from previous prime (426859067) and next prime (426859079).
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-426859073 is a prime.
It is a super-3 number, since 3×4268590733 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (426859079) 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 7 ways as a sum of consecutive naturals, for example, 113963 + ... + 117648.
It is an arithmetic number, because the mean of its divisors is an integer number (56744940).
Almost surely, 2426859073 is an apocalyptic number.
It is an amenable number.
426859073 is a deficient number, since it is larger than the sum of its proper divisors (27100447).
426859073 is a wasteful number, since it uses less digits than its factorization.
426859073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231727.
The product of its (nonzero) digits is 362880, while the sum is 44.
The square root of 426859073 is about 20660.5680706025. The cubic root of 426859073 is about 752.9419694061.
The spelling of 426859073 in words is "four hundred twenty-six million, eight hundred fifty-nine thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •