Base | Representation |
---|---|
bin | 11001011011111… |
… | …110110110000000 |
3 | 1002202000221110220 |
4 | 121123332312000 |
5 | 1333223000241 |
6 | 110203023040 |
7 | 13401306600 |
oct | 3133766600 |
9 | 1082027426 |
10 | 426765696 |
11 | 1a9997425 |
12 | bab0aa80 |
13 | 6a5533a6 |
14 | 40970c00 |
15 | 276ee166 |
hex | 196fed80 |
426765696 has 192 divisors, whose sum is σ = 1356522480. Its totient is φ = 118444032.
The previous prime is 426765683. The next prime is 426765697. The reversal of 426765696 is 696567624.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (192).
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (426765697) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 695886 + ... + 696498.
Almost surely, 2426765696 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 426765696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (678261240).
426765696 is an abundant number, since it is smaller than the sum of its proper divisors (929756784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
426765696 is a wasteful number, since it uses less digits than its factorization.
426765696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 681 (or 662 counting only the distinct ones).
The product of its digits is 3265920, while the sum is 51.
The square root of 426765696 is about 20658.3081591886. The cubic root of 426765696 is about 752.8870624559.
The spelling of 426765696 in words is "four hundred twenty-six million, seven hundred sixty-five thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •