Base | Representation |
---|---|
bin | 111111011110… |
… | …110011010000 |
3 | 1011022110110221 |
4 | 333132303100 |
5 | 13230004412 |
6 | 1352402424 |
7 | 261306466 |
oct | 77366320 |
9 | 34273427 |
10 | 16641232 |
11 | 9436893 |
12 | 56a6414 |
13 | 35a86aa |
14 | 22d2836 |
15 | 16dab07 |
hex | fdecd0 |
16641232 has 40 divisors (see below), whose sum is σ = 34424136. Its totient is φ = 7766016.
The previous prime is 16641221. The next prime is 16641239. The reversal of 16641232 is 23214661.
It can be written as a sum of positive squares in 4 ways, for example, as 287296 + 16353936 = 536^2 + 4044^2 .
It is a junction number, because it is equal to n+sod(n) for n = 16641197 and 16641206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16641239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52338 + ... + 52654.
Almost surely, 216641232 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 16641232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17212068).
16641232 is an abundant number, since it is smaller than the sum of its proper divisors (17782904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16641232 is a wasteful number, since it uses less digits than its factorization.
16641232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 535 (or 529 counting only the distinct ones).
The product of its digits is 1728, while the sum is 25.
The square root of 16641232 is about 4079.3666175033. The cubic root of 16641232 is about 255.3064724762.
Adding to 16641232 its reverse (23214661), we get a palindrome (39855893).
The spelling of 16641232 in words is "sixteen million, six hundred forty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •