Base | Representation |
---|---|
bin | 11001011100111… |
… | …001011100110000 |
3 | 1002202111010202120 |
4 | 121130321130300 |
5 | 1333303140434 |
6 | 110212114240 |
7 | 13403326464 |
oct | 3134713460 |
9 | 1082433676 |
10 | 427005744 |
11 | 1aa040810 |
12 | bb005980 |
13 | 6a608729 |
14 | 409d44a4 |
15 | 2774a349 |
hex | 19739730 |
427005744 has 160 divisors (see below), whose sum is σ = 1264204800. Its totient is φ = 123002880.
The previous prime is 427005743. The next prime is 427005751. The reversal of 427005744 is 447500724.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (427005743) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1209472 + ... + 1209824.
It is an arithmetic number, because the mean of its divisors is an integer number (7901280).
Almost surely, 2427005744 is an apocalyptic number.
427005744 is a gapful number since it is divisible by the number (44) 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 427005744, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (632102400).
427005744 is an abundant number, since it is smaller than the sum of its proper divisors (837199056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
427005744 is a wasteful number, since it uses less digits than its factorization.
427005744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 483 (or 477 counting only the distinct ones).
The product of its (nonzero) digits is 31360, while the sum is 33.
The square root of 427005744 is about 20664.1173051258. The cubic root of 427005744 is about 753.0281977910.
The spelling of 427005744 in words is "four hundred twenty-seven million, five thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •