Base | Representation |
---|---|
bin | 100001010101111101… |
… | …1100101010100000000 |
3 | 20211211012120002020000 |
4 | 1002223323211110000 |
5 | 2133121111000000 |
6 | 52521110120000 |
7 | 5113261646331 |
oct | 1025373452400 |
9 | 224735502200 |
10 | 71604000000 |
11 | 28404656005 |
12 | 11a64050000 |
13 | 69a1850c90 |
14 | 3673a6c288 |
15 | 1ce1350000 |
hex | 10abee5500 |
71604000000 has 1260 divisors, whose sum is σ = 304320557772. Its totient is φ = 16588800000.
The previous prime is 71603999959. The next prime is 71604000007. The reversal of 71604000000 is 40617.
It can be written as a sum of positive squares in 14 ways, for example, as 56727806976 + 14876193024 = 238176^2 + 121968^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71604000007) by changing a digit.
It is a polite number, since it can be written in 139 ways as a sum of consecutive naturals, for example, 4211999992 + ... + 4212000008.
Almost surely, 271604000000 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 71604000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152160278886).
71604000000 is an abundant number, since it is smaller than the sum of its proper divisors (232716557772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71604000000 is an frugal number, since it uses more digits than its factorization.
71604000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88 (or 40 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
Adding to 71604000000 its reverse (40617), we get a palindrome (71604040617).
The spelling of 71604000000 in words is "seventy-one billion, six hundred four million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •