Base | Representation |
---|---|
bin | 1001010110111100000000 |
3 | 11121122020001 |
4 | 21112330000 |
5 | 1112000443 |
6 | 124325344 |
7 | 26565220 |
oct | 11267400 |
9 | 4548201 |
10 | 2453248 |
11 | 1426186 |
12 | 9a3854 |
13 | 67b835 |
14 | 47c080 |
15 | 336d4d |
hex | 256f00 |
2453248 has 54 divisors (see below), whose sum is σ = 5751816. Its totient is φ = 1022976.
The previous prime is 2453233. The next prime is 2453251. The reversal of 2453248 is 8423542.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 66286 + ... + 66322.
22453248 is an apocalyptic number.
2453248 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2453248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2875908).
2453248 is an abundant number, since it is smaller than the sum of its proper divisors (3298568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2453248 is an frugal number, since it uses more digits than its factorization.
2453248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97 (or 46 counting only the distinct ones).
The product of its digits is 7680, while the sum is 28.
The square root of 2453248 is about 1566.2847761502. The cubic root of 2453248 is about 134.8695218524.
Multiplying 2453248 by its sum of digits (28), we get a square (68690944 = 82882).
2453248 divided by its sum of digits (28) gives a square (87616 = 2962).
It can be divided in two parts, 2453 and 248, that added together give a triangular number (2701 = T73).
The spelling of 2453248 in words is "two million, four hundred fifty-three thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •