Base | Representation |
---|---|
bin | 1100010111101111010… |
… | …00110011110111111101 |
3 | 1111122011021010201202100 |
4 | 12023313220303313331 |
5 | 23431011213344342 |
6 | 523134234215313 |
7 | 42465263562246 |
oct | 6136750636775 |
9 | 1448137121670 |
10 | 425061465597 |
11 | 1542a413043a |
12 | 6a468284539 |
13 | 31110815922 |
14 | 16804789ccd |
15 | b0cbbace4c |
hex | 62f7a33dfd |
425061465597 has 12 divisors (see below), whose sum is σ = 615580752384. Its totient is φ = 282634427400.
The previous prime is 425061465581. The next prime is 425061465613. The reversal of 425061465597 is 795564160524.
425061465597 is a `hidden beast` number, since 4 + 2 + 5 + 0 + 6 + 1 + 46 + 5 + 597 = 666.
It is an interprime number because it is at equal distance from previous prime (425061465581) and next prime (425061465613).
It is not a de Polignac number, because 425061465597 - 24 = 425061465581 is a prime.
It is a super-2 number, since 2×4250614655972 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425061455597) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61653279 + ... + 61660172.
It is an arithmetic number, because the mean of its divisors is an integer number (51298396032).
Almost surely, 2425061465597 is an apocalyptic number.
It is an amenable number.
425061465597 is a deficient number, since it is larger than the sum of its proper divisors (190519286787).
425061465597 is a wasteful number, since it uses less digits than its factorization.
425061465597 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123313840 (or 123313837 counting only the distinct ones).
The product of its (nonzero) digits is 9072000, while the sum is 54.
The spelling of 425061465597 in words is "four hundred twenty-five billion, sixty-one million, four hundred sixty-five thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •