Base | Representation |
---|---|
bin | 10011010111101011111… |
… | …000010011100010010111 |
3 | 11201020210210211000100201 |
4 | 103113223320103202113 |
5 | 133302044142102221 |
6 | 2455255553521331 |
7 | 165111645603640 |
oct | 23275370234227 |
9 | 4636723730321 |
10 | 1331102300311 |
11 | 473576601813 |
12 | 195b87573247 |
13 | 986a3967234 |
14 | 485d61706c7 |
15 | 249596db891 |
hex | 135ebe13897 |
1331102300311 has 32 divisors (see below), whose sum is σ = 1638856654848. Its totient is φ = 1055973805920.
The previous prime is 1331102300299. The next prime is 1331102300323. The reversal of 1331102300311 is 1130032011331.
It is an interprime number because it is at equal distance from previous prime (1331102300299) and next prime (1331102300323).
It is a cyclic number.
It is not a de Polignac number, because 1331102300311 - 27 = 1331102300183 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331102300111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41344326 + ... + 41376508.
It is an arithmetic number, because the mean of its divisors is an integer number (51214270464).
Almost surely, 21331102300311 is an apocalyptic number.
1331102300311 is a deficient number, since it is larger than the sum of its proper divisors (307754354537).
1331102300311 is a wasteful number, since it uses less digits than its factorization.
1331102300311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40531.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1331102300311 its reverse (1130032011331), we get a palindrome (2461134311642).
The spelling of 1331102300311 in words is "one trillion, three hundred thirty-one billion, one hundred two million, three hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •