Base | Representation |
---|---|
bin | 1001000100101010011… |
… | …10000110011111101001 |
3 | 1002210122202222002200121 |
4 | 10202111032012133221 |
5 | 20101421213201423 |
6 | 355113434403241 |
7 | 31344144013054 |
oct | 4422516063751 |
9 | 1083582862617 |
10 | 311741147113 |
11 | 110232828970 |
12 | 50501590521 |
13 | 23521471336 |
14 | 1113461ba9b |
15 | 819834c45d |
hex | 48953867e9 |
311741147113 has 4 divisors (see below), whose sum is σ = 340081251408. Its totient is φ = 283401042820.
The previous prime is 311741147101. The next prime is 311741147167.
311741147113 is nontrivially palindromic in base 10.
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 311741147113 - 225 = 311707592681 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311741147213) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 14170052131 + ... + 14170052152.
It is an arithmetic number, because the mean of its divisors is an integer number (85020312852).
Almost surely, 2311741147113 is an apocalyptic number.
It is an amenable number.
311741147113 is a deficient number, since it is larger than the sum of its proper divisors (28340104295).
311741147113 is a wasteful number, since it uses less digits than its factorization.
311741147113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28340104294.
The product of its digits is 7056, while the sum is 34.
It can be divided in two parts, 311741 and 147113, that added together give a palindrome (458854).
The spelling of 311741147113 in words is "three hundred eleven billion, seven hundred forty-one million, one hundred forty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •