Base | Representation |
---|---|
bin | 11001010111110… |
… | …100111110000110 |
3 | 1002122222121121220 |
4 | 121113310332012 |
5 | 1332433123203 |
6 | 110123421210 |
7 | 13356122610 |
oct | 3127647606 |
9 | 1078877556 |
10 | 425676678 |
11 | 1a9313209 |
12 | ba684806 |
13 | 6a2617bb |
14 | 40769db0 |
15 | 27586653 |
hex | 195f4f86 |
425676678 has 64 divisors (see below), whose sum is σ = 1003000320. Its totient is φ = 117907200.
The previous prime is 425676677. The next prime is 425676689. The reversal of 425676678 is 876676524.
It is a self number, because there is not a number n which added to its sum of digits gives 425676678.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425676677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 307548 + ... + 308928.
It is an arithmetic number, because the mean of its divisors is an integer number (15671880).
Almost surely, 2425676678 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 425676678, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (501500160).
425676678 is an abundant number, since it is smaller than the sum of its proper divisors (577323642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
425676678 is a wasteful number, since it uses less digits than its factorization.
425676678 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1613.
The product of its digits is 3386880, while the sum is 51.
The square root of 425676678 is about 20631.9334527814. The cubic root of 425676678 is about 752.2461128101.
The spelling of 425676678 in words is "four hundred twenty-five million, six hundred seventy-six thousand, six hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •