Base | Representation |
---|---|
bin | 10001101010010… |
… | …110011001011100 |
3 | 202122120100000122 |
4 | 101222112121130 |
5 | 1101324030320 |
6 | 45223014112 |
7 | 10225426361 |
oct | 2152263134 |
9 | 678510018 |
10 | 296314460 |
11 | 142297492 |
12 | 8329a338 |
13 | 4950a400 |
14 | 2b4d4468 |
15 | 1b031d25 |
hex | 11a9665c |
296314460 has 72 divisors (see below), whose sum is σ = 697273920. Its totient is φ = 105600768.
The previous prime is 296314441. The next prime is 296314477. The reversal of 296314460 is 64413692.
It is a self number, because there is not a number n which added to its sum of digits gives 296314460.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 96509 + ... + 99531.
It is an arithmetic number, because the mean of its divisors is an integer number (9684360).
Almost surely, 2296314460 is an apocalyptic number.
296314460 is a gapful number since it is divisible by the number (20) 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 296314460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (348636960).
296314460 is an abundant number, since it is smaller than the sum of its proper divisors (400959460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
296314460 is a wasteful number, since it uses less digits than its factorization.
296314460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3087 (or 3072 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 35.
The square root of 296314460 is about 17213.7869163064. The cubic root of 296314460 is about 666.6802891661.
The spelling of 296314460 in words is "two hundred ninety-six million, three hundred fourteen thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •