Base | Representation |
---|---|
bin | 1001101111011001101010 |
3 | 11210201200020 |
4 | 21233121222 |
5 | 1123202300 |
6 | 130421310 |
7 | 30463314 |
oct | 11573152 |
9 | 4721606 |
10 | 2553450 |
11 | 1494499 |
12 | a31836 |
13 | 6b5323 |
14 | 4a67b4 |
15 | 3568a0 |
hex | 26f66a |
2553450 has 48 divisors (see below), whose sum is σ = 6562080. Its totient is φ = 656320.
The previous prime is 2553433. The next prime is 2553457. The reversal of 2553450 is 543552.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2553450.
It is not an unprimeable number, because it can be changed into a prime (2553457) 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 23 ways as a sum of consecutive naturals, for example, 4057 + ... + 4643.
It is an arithmetic number, because the mean of its divisors is an integer number (136710).
22553450 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2553450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3281040).
2553450 is an abundant number, since it is smaller than the sum of its proper divisors (4008630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2553450 is a wasteful number, since it uses less digits than its factorization.
2553450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631 (or 626 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 24.
The square root of 2553450 is about 1597.9518140420. The cubic root of 2553450 is about 136.6813058547.
It can be divided in two parts, 2553 and 450, that added together give a palindrome (3003).
The spelling of 2553450 in words is "two million, five hundred fifty-three thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •