Base | Representation |
---|---|
bin | 1110010001111000000… |
… | …0011101010000000000 |
3 | 212110012112102001220220 |
4 | 3210132000131100000 |
5 | 13004402020302120 |
6 | 304410305303040 |
7 | 23503113313122 |
oct | 3443600352000 |
9 | 773175361826 |
10 | 245316572160 |
11 | 9504689a630 |
12 | 3b664034a80 |
13 | 1a1969b120a |
14 | bc327d9212 |
15 | 65aba96b40 |
hex | 391e01d400 |
245316572160 has 352 divisors, whose sum is σ = 893189486592. Its totient is φ = 56884101120.
The previous prime is 245316572143. The next prime is 245316572233. The reversal of 245316572160 is 61275613542.
It is a tau number, because it is divible by the number of its divisors (352).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3854517 + ... + 3917643.
Almost surely, 2245316572160 is an apocalyptic number.
245316572160 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 245316572160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (446594743296).
245316572160 is an abundant number, since it is smaller than the sum of its proper divisors (647872914432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
245316572160 is a wasteful number, since it uses less digits than its factorization.
245316572160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63189 (or 63171 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 42.
The spelling of 245316572160 in words is "two hundred forty-five billion, three hundred sixteen million, five hundred seventy-two thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •