Base | Representation |
---|---|
bin | 1100011000110011010… |
… | …11101101010101000001 |
3 | 1111200122001220221020000 |
4 | 12030121223231111001 |
5 | 23433143424304221 |
6 | 523311040510213 |
7 | 42515400556446 |
oct | 6143153552501 |
9 | 1450561827200 |
10 | 425632650561 |
11 | 154567598128 |
12 | 6a5a761b369 |
13 | 311a1c629b1 |
14 | 1685a5919cd |
15 | b111dd7e26 |
hex | 6319aed541 |
425632650561 has 20 divisors (see below), whose sum is σ = 636161670144. Its totient is φ = 283603339800.
The previous prime is 425632650523. The next prime is 425632650613. The reversal of 425632650561 is 165056236524.
425632650561 is a `hidden beast` number, since 4 + 2 + 5 + 6 + 32 + 6 + 50 + 561 = 666.
It is not a de Polignac number, because 425632650561 - 29 = 425632650049 is a prime.
It is a super-2 number, since 2×4256326505612 (a number of 24 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (425639650561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1252705 + ... + 1555806.
Almost surely, 2425632650561 is an apocalyptic number.
It is an amenable number.
425632650561 is a deficient number, since it is larger than the sum of its proper divisors (210529019583).
425632650561 is a wasteful number, since it uses less digits than its factorization.
425632650561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2810394 (or 2810385 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 45.
The spelling of 425632650561 in words is "four hundred twenty-five billion, six hundred thirty-two million, six hundred fifty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •