Base | Representation |
---|---|
bin | 11001011011110… |
… | …000001010010000 |
3 | 1002201220212222100 |
4 | 121123300022100 |
5 | 1333214034202 |
6 | 110201440400 |
7 | 13400636340 |
oct | 3133601220 |
9 | 1081825870 |
10 | 426705552 |
11 | 1a9956219 |
12 | baaa0100 |
13 | 6a531bc0 |
14 | 40956d20 |
15 | 276db41c |
hex | 196f0290 |
426705552 has 120 divisors (see below), whose sum is σ = 1469808704. Its totient is φ = 112534272.
The previous prime is 426705529. The next prime is 426705557. The reversal of 426705552 is 255507624.
426705552 is a `hidden beast` number, since 42 + 67 + 0 + 5 + 552 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (426705557) 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, 3178 + ... + 29385.
Almost surely, 2426705552 is an apocalyptic number.
426705552 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 426705552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (734904352).
426705552 is an abundant number, since it is smaller than the sum of its proper divisors (1043103152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
426705552 is a wasteful number, since it uses less digits than its factorization.
426705552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32597 (or 32588 counting only the distinct ones).
The product of its (nonzero) digits is 84000, while the sum is 36.
The square root of 426705552 is about 20656.8524223803. The cubic root of 426705552 is about 752.8516927224.
The spelling of 426705552 in words is "four hundred twenty-six million, seven hundred five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •