Base | Representation |
---|---|
bin | 11001011100111… |
… | …011110000100000 |
3 | 1002202111121201210 |
4 | 121130323300200 |
5 | 1333303441300 |
6 | 110212230120 |
7 | 13403366163 |
oct | 3134736040 |
9 | 1082447653 |
10 | 427015200 |
11 | 1aa047927 |
12 | bb00b340 |
13 | 6a60cb21 |
14 | 409d7ada |
15 | 2774d050 |
hex | 1973bc20 |
427015200 has 144 divisors (see below), whose sum is σ = 1399035456. Its totient is φ = 113126400.
The previous prime is 427015157. The next prime is 427015207. The reversal of 427015200 is 2510724.
It is not an unprimeable number, because it can be changed into a prime (427015207) 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, 433909 + ... + 434891.
It is an arithmetic number, because the mean of its divisors is an integer number (9715524).
Almost surely, 2427015200 is an apocalyptic number.
427015200 is a gapful number since it is divisible by the number (40) 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 427015200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (699517728).
427015200 is an abundant number, since it is smaller than the sum of its proper divisors (972020256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
427015200 is a wasteful number, since it uses less digits than its factorization.
427015200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1187 (or 1174 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 21.
The square root of 427015200 is about 20664.3461062769. The cubic root of 427015200 is about 753.0337563283.
Adding to 427015200 its reverse (2510724), we get a palindrome (429525924).
The spelling of 427015200 in words is "four hundred twenty-seven million, fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •