Base | Representation |
---|---|
bin | 10001111111001101000011… |
… | …010001111110110010100011 |
3 | 101101002212002002010000001222 |
4 | 101333031003101332302203 |
5 | 40332120022120142011 |
6 | 440130405340245255 |
7 | 22443342542663441 |
oct | 2177150321766243 |
9 | 341085062100058 |
10 | 79110131412131 |
11 | 23230466870226 |
12 | 8a580a6b4082b |
13 | 351b090384a41 |
14 | 1576d44d7bb91 |
15 | 922c81ac6ddb |
hex | 47f34347eca3 |
79110131412131 has 4 divisors (see below), whose sum is σ = 79110202151592. Its totient is φ = 79110060672672.
The previous prime is 79110131412073. The next prime is 79110131412197. The reversal of 79110131412131 is 13121413101197.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 79110131412131 - 238 = 78835253505187 is a prime.
It is a super-2 number, since 2×791101314121312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 79110131412091 and 79110131412100.
It is not an unprimeable number, because it can be changed into a prime (79110131412331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33664841 + ... + 35938026.
It is an arithmetic number, because the mean of its divisors is an integer number (19777550537898).
Almost surely, 279110131412131 is an apocalyptic number.
79110131412131 is a deficient number, since it is larger than the sum of its proper divisors (70739461).
79110131412131 is a wasteful number, since it uses less digits than its factorization.
79110131412131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70739460.
The product of its (nonzero) digits is 4536, while the sum is 35.
The spelling of 79110131412131 in words is "seventy-nine trillion, one hundred ten billion, one hundred thirty-one million, four hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •