Base | Representation |
---|---|
bin | 101111100100… |
… | …001110100000 |
3 | 212110111110110 |
4 | 233210032200 |
5 | 11143003102 |
6 | 1123131320 |
7 | 210662133 |
oct | 57441640 |
9 | 25414413 |
10 | 12469152 |
11 | 7047293 |
12 | 4213b40 |
13 | 27776c7 |
14 | 192821a |
15 | 116486c |
hex | be43a0 |
12469152 has 24 divisors (see below), whose sum is σ = 32731776. Its totient is φ = 4156352.
The previous prime is 12469139. The next prime is 12469153. The reversal of 12469152 is 25196421.
It is a tau number, because it is divible by the number of its divisors (24).
It is not an unprimeable number, because it can be changed into a prime (12469153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64848 + ... + 65039.
It is an arithmetic number, because the mean of its divisors is an integer number (1363824).
Almost surely, 212469152 is an apocalyptic number.
12469152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12469152 is an abundant number, since it is smaller than the sum of its proper divisors (20262624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12469152 is a wasteful number, since it uses less digits than its factorization.
12469152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129900 (or 129892 counting only the distinct ones).
The product of its digits is 4320, while the sum is 30.
The square root of 12469152 is about 3531.1686450805. The cubic root of 12469152 is about 231.8883727754. Note that the first 3 decimals are identical.
It can be divided in two parts, 12469 and 152, that added together give a palindrome (12621).
The spelling of 12469152 in words is "twelve million, four hundred sixty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •