Base | Representation |
---|---|
bin | 100001000101001010… |
… | …0011111100100111000 |
3 | 20210100220111020101010 |
4 | 1002022110133210320 |
5 | 2130442231323020 |
6 | 52345123553520 |
7 | 5063303633022 |
oct | 1021224374470 |
9 | 223326436333 |
10 | 71040104760 |
11 | 28145318189 |
12 | 1192722b8a0 |
13 | 6911a86c61 |
14 | 361cc03012 |
15 | 1cabab4de0 |
hex | 108a51f938 |
71040104760 has 128 divisors (see below), whose sum is σ = 216359424000. Its totient is φ = 18656879616.
The previous prime is 71040104743. The next prime is 71040104767. The reversal of 71040104760 is 6740104017.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71040104767) 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, 6292801 + ... + 6304079.
It is an arithmetic number, because the mean of its divisors is an integer number (1690308000).
Almost surely, 271040104760 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 71040104760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108179712000).
71040104760 is an abundant number, since it is smaller than the sum of its proper divisors (145319319240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71040104760 is a wasteful number, since it uses less digits than its factorization.
71040104760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12085 (or 12081 counting only the distinct ones).
The product of its (nonzero) digits is 4704, while the sum is 30.
Adding to 71040104760 its reverse (6740104017), we get a palindrome (77780208777).
The spelling of 71040104760 in words is "seventy-one billion, forty million, one hundred four thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •