Base | Representation |
---|---|
bin | 11000100100010… |
… | …101111100000000 |
3 | 1001201120220222020 |
4 | 120210111330000 |
5 | 1321004231344 |
6 | 104522241440 |
7 | 13133321421 |
oct | 3044257400 |
9 | 1051526866 |
10 | 412180224 |
11 | 1a1735115 |
12 | b6056280 |
13 | 67517631 |
14 | 3ca55648 |
15 | 262bc719 |
hex | 18915f00 |
412180224 has 144 divisors (see below), whose sum is σ = 1181268480. Its totient is φ = 127180800.
The previous prime is 412180213. The next prime is 412180267. The reversal of 412180224 is 422081214.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 412180194 and 412180203.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 685524 + ... + 686124.
Almost surely, 2412180224 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 412180224, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (590634240).
412180224 is an abundant number, since it is smaller than the sum of its proper divisors (769088256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
412180224 is a wasteful number, since it uses less digits than its factorization.
412180224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686 (or 672 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 24.
The square root of 412180224 is about 20302.2221443861. Note that the first 3 decimals coincide. The cubic root of 412180224 is about 744.2103694628.
The spelling of 412180224 in words is "four hundred twelve million, one hundred eighty thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •