Base | Representation |
---|---|
bin | 11001011000010… |
… | …010100000110001 |
3 | 1002200012202121111 |
4 | 121120102200301 |
5 | 1333001011211 |
6 | 110130153321 |
7 | 13360135441 |
oct | 3130224061 |
9 | 1080182544 |
10 | 425797681 |
11 | 1a9396111 |
12 | ba722841 |
13 | 6a2a48ba |
14 | 4079c121 |
15 | 275ac421 |
hex | 19612831 |
425797681 has 4 divisors (see below), whose sum is σ = 425873700. Its totient is φ = 425721664.
The previous prime is 425797667. The next prime is 425797703. The reversal of 425797681 is 186797524.
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 41990400 + 383807281 = 6480^2 + 19591^2 .
It is a cyclic number.
It is not a de Polignac number, because 425797681 - 25 = 425797649 is a prime.
It is a super-2 number, since 2×4257976812 = 362607330289955522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (425797621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28876 + ... + 41053.
It is an arithmetic number, because the mean of its divisors is an integer number (106468425).
Almost surely, 2425797681 is an apocalyptic number.
It is an amenable number.
425797681 is a deficient number, since it is larger than the sum of its proper divisors (76019).
425797681 is an equidigital number, since it uses as much as digits as its factorization.
425797681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76018.
The product of its digits is 846720, while the sum is 49.
The square root of 425797681 is about 20634.8656646948. The cubic root of 425797681 is about 752.3173839709.
The spelling of 425797681 in words is "four hundred twenty-five million, seven hundred ninety-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •