Base | Representation |
---|---|
bin | 1001101100001110100101 |
3 | 11210001211212 |
4 | 21230032211 |
5 | 1122243303 |
6 | 130241205 |
7 | 30410366 |
oct | 11541645 |
9 | 4701755 |
10 | 2540453 |
11 | 1485753 |
12 | a26205 |
13 | 6ac436 |
14 | 4a1b6d |
15 | 352ad8 |
hex | 26c3a5 |
2540453 has 4 divisors (see below), whose sum is σ = 2565708. Its totient is φ = 2515200.
The previous prime is 2540443. The next prime is 2540479. The reversal of 2540453 is 3540452.
2540453 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 2024929 + 515524 = 1423^2 + 718^2 .
It is a cyclic number.
It is not a de Polignac number, because 2540453 - 26 = 2540389 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 (2540413) 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, 12476 + ... + 12677.
It is an arithmetic number, because the mean of its divisors is an integer number (641427).
22540453 is an apocalyptic number.
It is an amenable number.
2540453 is a deficient number, since it is larger than the sum of its proper divisors (25255).
2540453 is a wasteful number, since it uses less digits than its factorization.
2540453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25254.
The product of its (nonzero) digits is 2400, while the sum is 23.
The square root of 2540453 is about 1593.8798574548. The cubic root of 2540453 is about 136.4490097444.
Subtracting 2540453 from its reverse (3540452), we obtain a palindrome (999999).
The spelling of 2540453 in words is "two million, five hundred forty thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •