Base | Representation |
---|---|
bin | 1000001101111100001101 |
3 | 11001110002011 |
4 | 20031330031 |
5 | 1022414003 |
6 | 114101221 |
7 | 24211423 |
oct | 10157415 |
9 | 4043064 |
10 | 2154253 |
11 | 1241582 |
12 | 87a811 |
13 | 5a570a |
14 | 401113 |
15 | 2c846d |
hex | 20df0d |
2154253 has 4 divisors (see below), whose sum is σ = 2159388. Its totient is φ = 2149120.
The previous prime is 2154241. The next prime is 2154259. The reversal of 2154253 is 3524512.
2154253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1493284 + 660969 = 1222^2 + 813^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2154253 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 (2154259) 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, 1876 + ... + 2797.
It is an arithmetic number, because the mean of its divisors is an integer number (539847).
22154253 is an apocalyptic number.
It is an amenable number.
2154253 is a deficient number, since it is larger than the sum of its proper divisors (5135).
2154253 is an equidigital number, since it uses as much as digits as its factorization.
2154253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5134.
The product of its digits is 1200, while the sum is 22.
The square root of 2154253 is about 1467.7373743283. The cubic root of 2154253 is about 129.1513357223.
Adding to 2154253 its reverse (3524512), we get a palindrome (5678765).
The spelling of 2154253 in words is "two million, one hundred fifty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •