Base | Representation |
---|---|
bin | 11001010110000… |
… | …000110000010101 |
3 | 1002122002102122122 |
4 | 121112000300111 |
5 | 1332322410121 |
6 | 110105305325 |
7 | 13352101034 |
oct | 3126006025 |
9 | 1078072578 |
10 | 425200661 |
11 | 1a9018606 |
12 | ba495245 |
13 | 6a125c32 |
14 | 4068471b |
15 | 274e05ab |
hex | 19580c15 |
425200661 has 2 divisors, whose sum is σ = 425200662. Its totient is φ = 425200660.
The previous prime is 425200637. The next prime is 425200667. The reversal of 425200661 is 166002524.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 302412100 + 122788561 = 17390^2 + 11081^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-425200661 is a prime.
It is a super-2 number, since 2×4252006612 = 361591204229673842, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 425200661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (425200667) 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 as a sum of consecutive naturals, namely, 212600330 + 212600331.
It is an arithmetic number, because the mean of its divisors is an integer number (212600331).
Almost surely, 2425200661 is an apocalyptic number.
It is an amenable number.
425200661 is a deficient number, since it is larger than the sum of its proper divisors (1).
425200661 is an equidigital number, since it uses as much as digits as its factorization.
425200661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 425200661 is about 20620.3942978790. The cubic root of 425200661 is about 751.9656060973.
The spelling of 425200661 in words is "four hundred twenty-five million, two hundred thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •