Base | Representation |
---|---|
bin | 11000001101011… |
… | …111100111000100 |
3 | 1001022022121122210 |
4 | 120031133213010 |
5 | 1312441044112 |
6 | 104150023420 |
7 | 13031363646 |
oct | 3015374704 |
9 | 1038277583 |
10 | 406190532 |
11 | 199313a60 |
12 | b4047b70 |
13 | 661cb237 |
14 | 3bd36896 |
15 | 259d7b3c |
hex | 1835f9c4 |
406190532 has 48 divisors (see below), whose sum is σ = 1039417344. Its totient is φ = 122436000.
The previous prime is 406190527. The next prime is 406190573. The reversal of 406190532 is 235091604.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 406190532.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17157 + ... + 33267.
It is an arithmetic number, because the mean of its divisors is an integer number (21654528).
Almost surely, 2406190532 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 406190532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (519708672).
406190532 is an abundant number, since it is smaller than the sum of its proper divisors (633226812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
406190532 is a wasteful number, since it uses less digits than its factorization.
406190532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16320 (or 16318 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 30.
The square root of 406190532 is about 20154.1690972364. The cubic root of 406190532 is about 740.5878771402.
The spelling of 406190532 in words is "four hundred six million, one hundred ninety thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •