Base | Representation |
---|---|
bin | 11001100000010… |
… | …011000101000000 |
3 | 1002211011102112200 |
4 | 121200103011000 |
5 | 1334020202102 |
6 | 110243153200 |
7 | 13414031364 |
oct | 3140230500 |
9 | 1084142480 |
10 | 427897152 |
11 | 1aa59a511 |
12 | bb375800 |
13 | 6a85b3a7 |
14 | 40b872a4 |
15 | 2787451c |
hex | 19813140 |
427897152 has 84 divisors (see below), whose sum is σ = 1279855200. Its totient is φ = 136426752.
The previous prime is 427897147. The next prime is 427897153. The reversal of 427897152 is 251798724.
It is a happy number.
It is a super-2 number, since 2×4278971522 = 366191945379422208, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 427897098 and 427897107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (427897153) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2902 + ... + 29397.
Almost surely, 2427897152 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 427897152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (639927600).
427897152 is an abundant number, since it is smaller than the sum of its proper divisors (851958048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
427897152 is a wasteful number, since it uses less digits than its factorization.
427897152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32340 (or 32327 counting only the distinct ones).
The product of its digits is 282240, while the sum is 45.
The square root of 427897152 is about 20685.6750433724. The cubic root of 427897152 is about 753.5518354006.
The spelling of 427897152 in words is "four hundred twenty-seven million, eight hundred ninety-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •