Base | Representation |
---|---|
bin | 100011011000010001110101… |
… | …1011110010110101110000001 |
3 | 1111210212102212002221101111221 |
4 | 1012300203223132112232001 |
5 | 311242200301324031423 |
6 | 3021511204110435041 |
7 | 122356315416265261 |
oct | 10660435336265601 |
9 | 1453772762841457 |
10 | 311200101002113 |
11 | 90181249055a54 |
12 | 2aaa07b8202a81 |
13 | 10485074a4c9ab |
14 | 56bc2456617a1 |
15 | 25ea06728de5d |
hex | 11b08eb796b81 |
311200101002113 has 8 divisors (see below), whose sum is σ = 311240811103200. Its totient is φ = 311159392079040.
The previous prime is 311200101002101. The next prime is 311200101002149.
It is a happy number.
311200101002113 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311200101002113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311200101002173) 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, 609404313 + ... + 609914761.
It is an arithmetic number, because the mean of its divisors is an integer number (38905101387900).
Almost surely, 2311200101002113 is an apocalyptic number.
It is an amenable number.
311200101002113 is a deficient number, since it is larger than the sum of its proper divisors (40710101087).
311200101002113 is an equidigital number, since it uses as much as digits as its factorization.
311200101002113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 589007.
The product of its (nonzero) digits is 36, while the sum is 16.
It can be divided in two parts, 31120010 and 1002113, that added together give a palindrome (32122123).
The spelling of 311200101002113 in words is "three hundred eleven trillion, two hundred billion, one hundred one million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •