Base | Representation |
---|---|
bin | 1011111011000110100110… |
… | …1100000000101010100101 |
3 | 1201102022020100222211220021 |
4 | 2332301221230000222211 |
5 | 3204243301403112013 |
6 | 43514353524035141 |
7 | 2522111231450134 |
oct | 276615154005245 |
9 | 51368210884807 |
10 | 13110013332133 |
11 | 41a4a1a8264a3 |
12 | 1578984b32ab1 |
13 | 741365b72753 |
14 | 334756cb991b |
15 | 17b04ca14a8d |
hex | bec69b00aa5 |
13110013332133 has 2 divisors, whose sum is σ = 13110013332134. Its totient is φ = 13110013332132.
The previous prime is 13110013332121. The next prime is 13110013332137. The reversal of 13110013332133 is 33123331001131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12695588969569 + 414424362564 = 3563087^2 + 643758^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13110013332133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13110013332098 and 13110013332107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13110013332137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555006666066 + 6555006666067.
It is an arithmetic number, because the mean of its divisors is an integer number (6555006666067).
Almost surely, 213110013332133 is an apocalyptic number.
It is an amenable number.
13110013332133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110013332133 is an equidigital number, since it uses as much as digits as its factorization.
13110013332133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 13110013332133 its reverse (33123331001131), we get a palindrome (46233344333264).
The spelling of 13110013332133 in words is "thirteen trillion, one hundred ten billion, thirteen million, three hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •