Base | Representation |
---|---|
bin | 10010111010110101110… |
… | …111011001100011111111 |
3 | 11121021212101110022022001 |
4 | 102322311313121203333 |
5 | 132300132104301421 |
6 | 2433134434203131 |
7 | 162634315616566 |
oct | 22726567314377 |
9 | 4537771408261 |
10 | 1300131322111 |
11 | 461423267466 |
12 | 18bb834234a7 |
13 | 957a938692b |
14 | 46cd8bb0bdd |
15 | 23c45715691 |
hex | 12eb5dd98ff |
1300131322111 has 8 divisors (see below), whose sum is σ = 1319480870400. Its totient is φ = 1280924575320.
The previous prime is 1300131322081. The next prime is 1300131322141. The reversal of 1300131322111 is 1112231310031.
It is an interprime number because it is at equal distance from previous prime (1300131322081) and next prime (1300131322141).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1300131322111 - 213 = 1300131313919 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300131322141) 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, 35682031 + ... + 35718448.
It is an arithmetic number, because the mean of its divisors is an integer number (164935108800).
Almost surely, 21300131322111 is an apocalyptic number.
1300131322111 is a deficient number, since it is larger than the sum of its proper divisors (19349548289).
1300131322111 is a wasteful number, since it uses less digits than its factorization.
1300131322111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71400749.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1300131322111 its reverse (1112231310031), we get a palindrome (2412362632142).
The spelling of 1300131322111 in words is "one trillion, three hundred billion, one hundred thirty-one million, three hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •