Base | Representation |
---|---|
bin | 1001000011101010000000 |
3 | 11110121220000 |
4 | 21003222000 |
5 | 1101434042 |
6 | 122520000 |
7 | 26116035 |
oct | 11035200 |
9 | 4417800 |
10 | 2374272 |
11 | 138190a |
12 | 966000 |
13 | 6518c4 |
14 | 45b38c |
15 | 31d74c |
hex | 243a80 |
2374272 has 80 divisors (see below), whose sum is σ = 7096650. Its totient is φ = 787968.
The previous prime is 2374261. The next prime is 2374277. The reversal of 2374272 is 2724732.
2374272 is a `hidden beast` number, since 237 + 427 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 1498176 + 876096 = 1224^2 + 936^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 12.
It is not an unprimeable number, because it can be changed into a prime (2374277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 10254 + ... + 10482.
22374272 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2374272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3548325).
2374272 is an abundant number, since it is smaller than the sum of its proper divisors (4722378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2374272 is an equidigital number, since it uses as much as digits as its factorization.
2374272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255 (or 234 counting only the distinct ones).
The product of its digits is 4704, while the sum is 27.
The square root of 2374272 is about 1540.8672882504. The cubic root of 2374272 is about 133.4064487875.
The spelling of 2374272 in words is "two million, three hundred seventy-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •