Base | Representation |
---|---|
bin | 1000101010000101100… |
… | …00000100011010000000 |
3 | 1001102211101020212110220 |
4 | 10111002300010122000 |
5 | 14333210444000030 |
6 | 344353531023040 |
7 | 30330435503610 |
oct | 4250260043200 |
9 | 1042741225426 |
10 | 297472640640 |
11 | 10518060685a |
12 | 4979ab9aa80 |
13 | 220893403b6 |
14 | 1057d60ca40 |
15 | 7b1087ba10 |
hex | 4542c04680 |
297472640640 has 512 divisors, whose sum is σ = 1122040995840. Its totient is φ = 65625292800.
The previous prime is 297472640629. The next prime is 297472640671. The reversal of 297472640640 is 46046274792.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 46109415 + ... + 46115865.
It is an arithmetic number, because the mean of its divisors is an integer number (2191486320).
Almost surely, 2297472640640 is an apocalyptic number.
297472640640 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 297472640640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (561020497920).
297472640640 is an abundant number, since it is smaller than the sum of its proper divisors (824568355200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
297472640640 is a wasteful number, since it uses less digits than its factorization.
297472640640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6600 (or 6588 counting only the distinct ones).
The product of its (nonzero) digits is 4064256, while the sum is 51.
The spelling of 297472640640 in words is "two hundred ninety-seven billion, four hundred seventy-two million, six hundred forty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •