Base | Representation |
---|---|
bin | 110001010100… |
… | …010011111101 |
3 | 220022211020012 |
4 | 301110103331 |
5 | 11302201003 |
6 | 1141033005 |
7 | 214613462 |
oct | 61242375 |
9 | 26284205 |
10 | 12928253 |
11 | 7330208 |
12 | 43b5765 |
13 | 28a8670 |
14 | 1a07669 |
15 | 12058d8 |
hex | c544fd |
12928253 has 8 divisors (see below), whose sum is σ = 14131488. Its totient is φ = 11754864.
The previous prime is 12928247. The next prime is 12928261. The reversal of 12928253 is 35282921.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12928253 - 212 = 12924157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12928213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6551 + ... + 8292.
It is an arithmetic number, because the mean of its divisors is an integer number (1766436).
Almost surely, 212928253 is an apocalyptic number.
12928253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12928253 is a deficient number, since it is larger than the sum of its proper divisors (1203235).
12928253 is a wasteful number, since it uses less digits than its factorization.
12928253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14923.
The product of its digits is 8640, while the sum is 32.
The square root of 12928253 is about 3595.5879908577. The cubic root of 12928253 is about 234.7001033389.
It can be divided in two parts, 129 and 28253, that added together give a palindrome (28382).
The spelling of 12928253 in words is "twelve million, nine hundred twenty-eight thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •