Base | Representation |
---|---|
bin | 1001000111110100… |
… | …01000100001000000 |
3 | 110122022100011021210 |
4 | 10203322020201000 |
5 | 40012214042323 |
6 | 2125544250120 |
7 | 232235201415 |
oct | 44372104100 |
9 | 13568304253 |
10 | 4897409088 |
11 | 2093506a30 |
12 | b48170940 |
13 | 60081ba00 |
14 | 3465d810c |
15 | 1d9e3e293 |
hex | 123e88840 |
4897409088 has 168 divisors, whose sum is σ = 15307824096. Its totient is φ = 1369804800.
The previous prime is 4897409081. The next prime is 4897409089. The reversal of 4897409088 is 8809047984.
It is not an unprimeable number, because it can be changed into a prime (4897409081) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 350068 + ... + 363788.
Almost surely, 24897409088 is an apocalyptic number.
4897409088 is a gapful number since it is divisible by the number (48) 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 4897409088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7653912048).
4897409088 is an abundant number, since it is smaller than the sum of its proper divisors (10410415008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4897409088 is a wasteful number, since it uses less digits than its factorization.
4897409088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13773 (or 13750 counting only the distinct ones).
The product of its (nonzero) digits is 4644864, while the sum is 57.
The square root of 4897409088 is about 69981.4910387025. The cubic root of 4897409088 is about 1698.1998346942.
The spelling of 4897409088 in words is "four billion, eight hundred ninety-seven million, four hundred nine thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •