Base | Representation |
---|---|
bin | 110010011111… |
… | …101001100000 |
3 | 220220111112001 |
4 | 302133221200 |
5 | 11342034312 |
6 | 1151413344 |
7 | 220340230 |
oct | 62375140 |
9 | 26814461 |
10 | 13236832 |
11 | 7521034 |
12 | 4524254 |
13 | 2985c5b |
14 | 1a87cc0 |
15 | 1267057 |
hex | c9fa60 |
13236832 has 24 divisors (see below), whose sum is σ = 29783376. Its totient is φ = 5672832.
The previous prime is 13236793. The next prime is 13236833. The reversal of 13236832 is 23863231.
13236832 is nontrivially palindromic in base 12.
13236832 is digitally balanced in base 2 and base 8, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (28).
13236832 is strictly pandigital in base 8.
It is a self number, because there is not a number n which added to its sum of digits gives 13236832.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13236833) 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, 29323 + ... + 29770.
It is an arithmetic number, because the mean of its divisors is an integer number (1240974).
Almost surely, 213236832 is an apocalyptic number.
It is an amenable number.
13236832 is an abundant number, since it is smaller than the sum of its proper divisors (16546544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13236832 is an equidigital number, since it uses as much as digits as its factorization.
13236832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59110 (or 59102 counting only the distinct ones).
The product of its digits is 5184, while the sum is 28.
The square root of 13236832 is about 3638.2457311182. The cubic root of 13236832 is about 236.5527596625.
The spelling of 13236832 in words is "thirteen million, two hundred thirty-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •