Base | Representation |
---|---|
bin | 1000101010000111000… |
… | …00101111010010100000 |
3 | 1001102212021021001221011 |
4 | 10111003200233102200 |
5 | 14333222230233300 |
6 | 344355104310304 |
7 | 30330652112563 |
oct | 4250340572240 |
9 | 1042767231834 |
10 | 297485399200 |
11 | 105187830520 |
12 | 497a3312394 |
13 | 2208bb89742 |
14 | 105811b04da |
15 | 7b11a4beba |
hex | 454382f4a0 |
297485399200 has 288 divisors, whose sum is σ = 829386915840. Its totient is φ = 103205760000.
The previous prime is 297485399191. The next prime is 297485399207. The reversal of 297485399200 is 2993584792.
It is not an unprimeable number, because it can be changed into a prime (297485399207) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 19361121 + ... + 19376479.
It is an arithmetic number, because the mean of its divisors is an integer number (2879815680).
Almost surely, 2297485399200 is an apocalyptic number.
297485399200 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 297485399200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (414693457920).
297485399200 is an abundant number, since it is smaller than the sum of its proper divisors (531901516640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
297485399200 is a wasteful number, since it uses less digits than its factorization.
297485399200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15492 (or 15479 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 58.
The spelling of 297485399200 in words is "two hundred ninety-seven billion, four hundred eighty-five million, three hundred ninety-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •