Base | Representation |
---|---|
bin | 1001101100110… |
… | …0101000000000 |
3 | 2211112222000000 |
4 | 2123030220000 |
5 | 40403342112 |
6 | 4012000000 |
7 | 1002544224 |
oct | 233145000 |
9 | 84488000 |
10 | 40684032 |
11 | 20a68574 |
12 | 11760000 |
13 | 8575cbc |
14 | 5590784 |
15 | 38897dc |
hex | 26cca00 |
40684032 has 140 divisors (see below), whose sum is σ = 122995290. Its totient is φ = 13436928.
The previous prime is 40683991. The next prime is 40684051. The reversal of 40684032 is 23048604.
It can be written as a sum of positive squares in only one way, i.e., 31539456 + 9144576 = 5616^2 + 3024^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 3.
It is a junction number, because it is equal to n+sod(n) for n = 40683987 and 40684005.
It is an unprimeable number.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 373194 + ... + 373302.
Almost surely, 240684032 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 40684032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61497645).
40684032 is an abundant number, since it is smaller than the sum of its proper divisors (82311258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40684032 is an frugal number, since it uses more digits than its factorization.
40684032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145 (or 114 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
The square root of 40684032 is about 6378.4035620208. The cubic root of 40684032 is about 343.9336450345.
It can be divided in two parts, 4068 and 4032, that added together give a square (8100 = 902).
The spelling of 40684032 in words is "forty million, six hundred eighty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •