Base | Representation |
---|---|
bin | 10011001101010111111… |
… | …111111010001100100111 |
3 | 11200012020020211111200102 |
4 | 103031113333322030213 |
5 | 133111411010043421 |
6 | 2450225232334315 |
7 | 164240415116543 |
oct | 23152777721447 |
9 | 4605206744612 |
10 | 1320031331111 |
11 | 469905300799 |
12 | 1939b79a439b |
13 | 9762b121b9c |
14 | 47c65aa8a23 |
15 | 2450c7ce60b |
hex | 13357ffa327 |
1320031331111 has 4 divisors (see below), whose sum is σ = 1320974886000. Its totient is φ = 1319087776224.
The previous prime is 1320031331089. The next prime is 1320031331149. The reversal of 1320031331111 is 1111331300231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1320031331111 is a prime.
It is a super-3 number, since 3×13200313311113 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320031331711) 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, 471775346 + ... + 471778143.
It is an arithmetic number, because the mean of its divisors is an integer number (330243721500).
Almost surely, 21320031331111 is an apocalyptic number.
1320031331111 is a deficient number, since it is larger than the sum of its proper divisors (943554889).
1320031331111 is an equidigital number, since it uses as much as digits as its factorization.
1320031331111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 943554888.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 1320031331111 its reverse (1111331300231), we get a palindrome (2431362631342).
The spelling of 1320031331111 in words is "one trillion, three hundred twenty billion, thirty-one million, three hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •