Base | Representation |
---|---|
bin | 10000010101000111101010… |
… | …010011011110000111101001 |
3 | 100102021221011210121101012010 |
4 | 100111013222103132013221 |
5 | 33403200010224112230 |
6 | 412425404443510133 |
7 | 21061554340666011 |
oct | 2025075223360751 |
9 | 312257153541163 |
10 | 71820079129065 |
11 | 2097a7a7360653 |
12 | 807b267228349 |
13 | 310c7b1b40667 |
14 | 13a4178c36c41 |
15 | 8483121ea9b0 |
hex | 4151ea4de1e9 |
71820079129065 has 32 divisors (see below), whose sum is σ = 116018094928896. Its totient is φ = 37935583770560.
The previous prime is 71820079129061. The next prime is 71820079129109. The reversal of 71820079129065 is 56092197002817.
It is not a de Polignac number, because 71820079129065 - 22 = 71820079129061 is a prime.
It is a super-2 number, since 2×718200791290652 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 71820079128996 and 71820079129014.
It is not an unprimeable number, because it can be changed into a prime (71820079129061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 360591 + ... + 11990420.
It is an arithmetic number, because the mean of its divisors is an integer number (3625565466528).
Almost surely, 271820079129065 is an apocalyptic number.
It is an amenable number.
71820079129065 is a deficient number, since it is larger than the sum of its proper divisors (44198015799831).
71820079129065 is a wasteful number, since it uses less digits than its factorization.
71820079129065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12354749.
The product of its (nonzero) digits is 3810240, while the sum is 57.
The spelling of 71820079129065 in words is "seventy-one trillion, eight hundred twenty billion, seventy-nine million, one hundred twenty-nine thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •