Base | Representation |
---|---|
bin | 100001000111011101… |
… | …0100111111000100101 |
3 | 20210120021120112200100 |
4 | 1002032322213320211 |
5 | 2131122001143000 |
6 | 52400520334313 |
7 | 5065231206054 |
oct | 1021672477045 |
9 | 223507515610 |
10 | 71117209125 |
11 | 281848a08a6 |
12 | 11949014399 |
13 | 6924a42341 |
14 | 362915439b |
15 | 1cb3745a00 |
hex | 108eea7e25 |
71117209125 has 48 divisors (see below), whose sum is σ = 128248164720. Its totient is φ = 37915113600.
The previous prime is 71117209109. The next prime is 71117209147. The reversal of 71117209125 is 52190271117.
It can be written as a sum of positive squares in 8 ways, for example, as 15138595521 + 55978613604 = 123039^2 + 236598^2 .
It is not a de Polignac number, because 71117209125 - 24 = 71117209109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 71117209125.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3487459 + ... + 3507791.
It is an arithmetic number, because the mean of its divisors is an integer number (2671836765).
Almost surely, 271117209125 is an apocalyptic number.
71117209125 is a gapful number since it is divisible by the number (75) formed by its first and last digit.
It is an amenable number.
71117209125 is a deficient number, since it is larger than the sum of its proper divisors (57130955595).
71117209125 is a wasteful number, since it uses less digits than its factorization.
71117209125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23463 (or 23450 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 36.
The spelling of 71117209125 in words is "seventy-one billion, one hundred seventeen million, two hundred nine thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •