Base | Representation |
---|---|
bin | 1000001101001110000000 |
3 | 11001022000122 |
4 | 20031032000 |
5 | 1022320141 |
6 | 114035412 |
7 | 24200000 |
oct | 10151600 |
9 | 4038018 |
10 | 2151296 |
11 | 123a334 |
12 | 878b68 |
13 | 5a4274 |
14 | 400000 |
15 | 2c764b |
hex | 20d380 |
2151296 has 48 divisors (see below), whose sum is σ = 5000040. Its totient is φ = 921984.
The previous prime is 2151293. The next prime is 2151301. The reversal of 2151296 is 6921512.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
Its product of digits (1080) is a multiple of the sum of its prime divisors (9).
It is a nialpdrome in base 14.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2151293) 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 5 ways as a sum of consecutive naturals, for example, 307325 + ... + 307331.
22151296 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 2151296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2500020).
2151296 is an abundant number, since it is smaller than the sum of its proper divisors (2848744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2151296 is an frugal number, since it uses more digits than its factorization.
2151296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49 (or 9 counting only the distinct ones).
The product of its digits is 1080, while the sum is 26.
The square root of 2151296 is about 1466.7296956154. The cubic root of 2151296 is about 129.0922161776.
The spelling of 2151296 in words is "two million, one hundred fifty-one thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •