Base | Representation |
---|---|
bin | 11000001001101… |
… | …101110010100000 |
3 | 1001020110021221121 |
4 | 120021231302200 |
5 | 1312212400112 |
6 | 104112502024 |
7 | 13020100126 |
oct | 3011556240 |
9 | 1036407847 |
10 | 405200032 |
11 | 1987a7866 |
12 | b384a914 |
13 | 65c42443 |
14 | 3bb59916 |
15 | 2588e407 |
hex | 1826dca0 |
405200032 has 48 divisors (see below), whose sum is σ = 848027880. Its totient is φ = 189923328.
The previous prime is 405200027. The next prime is 405200057. The reversal of 405200032 is 230002504.
It can be written as a sum of positive squares in 4 ways, for example, as 228735376 + 176464656 = 15124^2 + 13284^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 405199979 and 405200015.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 149344 + ... + 152032.
Almost surely, 2405200032 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 405200032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (424013940).
405200032 is an abundant number, since it is smaller than the sum of its proper divisors (442827848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
405200032 is a wasteful number, since it uses less digits than its factorization.
405200032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2993 (or 2985 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 16.
The square root of 405200032 is about 20129.5810189880. The cubic root of 405200032 is about 739.9854099875.
Adding to 405200032 its reverse (230002504), we get a palindrome (635202536).
The spelling of 405200032 in words is "four hundred five million, two hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •