Base | Representation |
---|---|
bin | 110001011010… |
… | …101010001101 |
3 | 220101010220011 |
4 | 301122222031 |
5 | 11304014003 |
6 | 1141353221 |
7 | 215052334 |
oct | 61325215 |
9 | 26333804 |
10 | 12954253 |
11 | 73487a4 |
12 | 4408811 |
13 | 28b7450 |
14 | 1a12d1b |
15 | 120d46d |
hex | c5aa8d |
12954253 has 8 divisors (see below), whose sum is σ = 14095928. Its totient is φ = 11833344.
The previous prime is 12954247. The next prime is 12954269. The reversal of 12954253 is 35245921.
12954253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 8649 + 12945604 = 93^2 + 3598^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12954253 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 (12954203) 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, 3876 + ... + 6397.
It is an arithmetic number, because the mean of its divisors is an integer number (1761991).
Almost surely, 212954253 is an apocalyptic number.
12954253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12954253 is a deficient number, since it is larger than the sum of its proper divisors (1141675).
12954253 is a wasteful number, since it uses less digits than its factorization.
12954253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10383.
The product of its digits is 10800, while the sum is 31.
The square root of 12954253 is about 3599.2017170478. The cubic root of 12954253 is about 234.8573330523.
The spelling of 12954253 in words is "twelve million, nine hundred fifty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •