Base | Representation |
---|---|
bin | 11000001101011… |
… | …000001101101000 |
3 | 1001022021002002120 |
4 | 120031120031220 |
5 | 1312434111412 |
6 | 104145231240 |
7 | 13031206422 |
oct | 3015301550 |
9 | 1038232076 |
10 | 406160232 |
11 | 1992a3215 |
12 | b4032520 |
13 | 661ba4ca |
14 | 3bd29812 |
15 | 259cdb8c |
hex | 18358368 |
406160232 has 16 divisors (see below), whose sum is σ = 1015400640. Its totient is φ = 135386736.
The previous prime is 406160213. The next prime is 406160239. The reversal of 406160232 is 232061604.
It is a super-4 number, since 4×4061602324 (a number of 36 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 16923343 = 406160232 / (4 + 0 + 6 + 1 + 6 + 0 + 2 + 3 + 2).
It is not an unprimeable number, because it can be changed into a prime (406160239) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8461648 + ... + 8461695.
It is an arithmetic number, because the mean of its divisors is an integer number (63462540).
Almost surely, 2406160232 is an apocalyptic number.
It is an amenable number.
406160232 is an abundant number, since it is smaller than the sum of its proper divisors (609240408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406160232 is a wasteful number, since it uses less digits than its factorization.
406160232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16923352 (or 16923348 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 406160232 is about 20153.4173777054. The cubic root of 406160232 is about 740.5694618327.
The spelling of 406160232 in words is "four hundred six million, one hundred sixty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •