Base | Representation |
---|---|
bin | 1000101111111011… |
… | …10101100101100000 |
3 | 110010100100001010210 |
4 | 10113331311211200 |
5 | 34104421203121 |
6 | 2054030054120 |
7 | 224253203430 |
oct | 42775654540 |
9 | 13110301123 |
10 | 4697053536 |
11 | 1aa040092a |
12 | ab104a340 |
13 | 59b16b926 |
14 | 327b622c0 |
15 | 1c7564876 |
hex | 117f75960 |
4697053536 has 192 divisors, whose sum is σ = 15312568320. Its totient is φ = 1230266880.
The previous prime is 4697053531. The next prime is 4697053553. The reversal of 4697053536 is 6353507964.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4697053531) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 389875 + ... + 401741.
It is an arithmetic number, because the mean of its divisors is an integer number (79752960).
Almost surely, 24697053536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4697053536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7656284160).
4697053536 is an abundant number, since it is smaller than the sum of its proper divisors (10615514784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4697053536 is a wasteful number, since it uses less digits than its factorization.
4697053536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11937 (or 11929 counting only the distinct ones).
The product of its (nonzero) digits is 2041200, while the sum is 48.
The square root of 4697053536 is about 68535.0533376899. The cubic root of 4697053536 is about 1674.7185728713.
The spelling of 4697053536 in words is "four billion, six hundred ninety-seven million, fifty-three thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •