Base | Representation |
---|---|
bin | 100001000111010000… |
… | …1001010010011011010 |
3 | 20210112211000102121220 |
4 | 1002032201022103122 |
5 | 2131113244044422 |
6 | 52400121312510 |
7 | 5065120366110 |
oct | 1021641122332 |
9 | 223484012556 |
10 | 71110534362 |
11 | 28181051a6a |
12 | 11946935736 |
13 | 692354618a |
14 | 36282d7ab0 |
15 | 1cb2d77e5c |
hex | 108e84a4da |
71110534362 has 64 divisors (see below), whose sum is σ = 164897316864. Its totient is φ = 20022670080.
The previous prime is 71110534337. The next prime is 71110534367. The reversal of 71110534362 is 26343501117.
It is not an unprimeable number, because it can be changed into a prime (71110534367) 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, 11307583 + ... + 11313869.
It is an arithmetic number, because the mean of its divisors is an integer number (2576520576).
Almost surely, 271110534362 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 71110534362, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82448658432).
71110534362 is an abundant number, since it is smaller than the sum of its proper divisors (93786782502).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71110534362 is a wasteful number, since it uses less digits than its factorization.
71110534362 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10163.
The product of its (nonzero) digits is 15120, while the sum is 33.
The spelling of 71110534362 in words is "seventy-one billion, one hundred ten million, five hundred thirty-four thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •