Base | Representation |
---|---|
bin | 1000000000010001100000 |
3 | 10221121021210 |
4 | 20000101200 |
5 | 1014121042 |
6 | 112550120 |
7 | 23556261 |
oct | 10002140 |
9 | 3847253 |
10 | 2098272 |
11 | 1203510 |
12 | 852340 |
13 | 5860a7 |
14 | 3c8968 |
15 | 2b6a9c |
hex | 200460 |
2098272 has 48 divisors (see below), whose sum is σ = 6011712. Its totient is φ = 635520.
The previous prime is 2098253. The next prime is 2098277. The reversal of 2098272 is 2728902.
It is a tau number, because it is divible by the number of its divisors (48).
It is a d-powerful number, because it can be written as 24 + 0 + 9 + 82 + 210 + 7 + 221 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2098277) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63 + ... + 2049.
It is an arithmetic number, because the mean of its divisors is an integer number (125244).
22098272 is an apocalyptic number.
2098272 is a gapful number since it is divisible by the number (22) 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 2098272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3005856).
2098272 is an abundant number, since it is smaller than the sum of its proper divisors (3913440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2098272 is a wasteful number, since it uses less digits than its factorization.
2098272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2011 (or 2003 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 2098272 is about 1448.5413352749. The cubic root of 2098272 is about 128.0227824031.
The spelling of 2098272 in words is "two million, ninety-eight thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •