Base | Representation |
---|---|
bin | 10001111101110000110101… |
… | …110111011110011001111001 |
3 | 101100202101111221122102201111 |
4 | 101331300311313132121321 |
5 | 40324004234230041441 |
6 | 440013113003320321 |
7 | 22433236155553213 |
oct | 2175606567363171 |
9 | 340671457572644 |
10 | 79011122112121 |
11 | 231a2479686751 |
12 | 8a40a74b200a1 |
13 | 3511941ba7414 |
14 | 15722317275b3 |
15 | 9203d9833081 |
hex | 47dc35dde679 |
79011122112121 has 4 divisors (see below), whose sum is σ = 79097852214144. Its totient is φ = 78924392010100.
The previous prime is 79011122112107. The next prime is 79011122112133. The reversal of 79011122112121 is 12121122111097.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 79011122112121 - 27 = 79011122111993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (79011122112821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43365049645 + ... + 43365051466.
It is an arithmetic number, because the mean of its divisors is an integer number (19774463053536).
Almost surely, 279011122112121 is an apocalyptic number.
It is an amenable number.
79011122112121 is a deficient number, since it is larger than the sum of its proper divisors (86730102023).
79011122112121 is an equidigital number, since it uses as much as digits as its factorization.
79011122112121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86730102022.
The product of its (nonzero) digits is 1008, while the sum is 31.
The spelling of 79011122112121 in words is "seventy-nine trillion, eleven billion, one hundred twenty-two million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •