Base | Representation |
---|---|
bin | 10001111101110000110110… |
… | …010110110100110011011011 |
3 | 101100202101112112002221222122 |
4 | 101331300312112310303123 |
5 | 40324004243331032311 |
6 | 440013113455411455 |
7 | 22433236315452053 |
oct | 2175606626646333 |
9 | 340671475087878 |
10 | 79011130330331 |
11 | 231a248328a161 |
12 | 8a40a77823b8b |
13 | 35119437c3c74 |
14 | 1572232866563 |
15 | 9203da4080db |
hex | 47dc365b4cdb |
79011130330331 has 8 divisors (see below), whose sum is σ = 85604398388784. Its totient is φ = 72634034995200.
The previous prime is 79011130330313. The next prime is 79011130330337. The reversal of 79011130330331 is 13303303111097.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 79011130330331 - 218 = 79011130068187 is a prime.
It is a super-2 number, since 2×790111303303312 (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 = 79011130330291 and 79011130330300.
It is not an unprimeable number, because it can be changed into a prime (79011130330337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54043180070 + ... + 54043181531.
It is an arithmetic number, because the mean of its divisors is an integer number (10700549798598).
Almost surely, 279011130330331 is an apocalyptic number.
79011130330331 is a deficient number, since it is larger than the sum of its proper divisors (6593268058453).
79011130330331 is a wasteful number, since it uses less digits than its factorization.
79011130330331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108086361661.
The product of its (nonzero) digits is 15309, while the sum is 35.
The spelling of 79011130330331 in words is "seventy-nine trillion, eleven billion, one hundred thirty million, three hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •