Base | Representation |
---|---|
bin | 1011111011001110000011… |
… | …1001011001011011010101 |
3 | 1201102111101202100021101021 |
4 | 2332303200321121123111 |
5 | 3204311400403031013 |
6 | 43515324211001141 |
7 | 2522211625243114 |
oct | 276634071313325 |
9 | 51374352307337 |
10 | 13112013330133 |
11 | 41a5856771603 |
12 | 15792428991b1 |
13 | 7415c4318c13 |
14 | 3348a6773c7b |
15 | 17b1183c6a8d |
hex | bece0e596d5 |
13112013330133 has 2 divisors, whose sum is σ = 13112013330134. Its totient is φ = 13112013330132.
The previous prime is 13112013330049. The next prime is 13112013330137. The reversal of 13112013330133 is 33103331021131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12491255284209 + 620758045924 = 3534297^2 + 787882^2 .
It is a cyclic number.
It is not a de Polignac number, because 13112013330133 - 225 = 13111979775701 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13112013330098 and 13112013330107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13112013330137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556006665066 + 6556006665067.
It is an arithmetic number, because the mean of its divisors is an integer number (6556006665067).
Almost surely, 213112013330133 is an apocalyptic number.
It is an amenable number.
13112013330133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13112013330133 is an equidigital number, since it uses as much as digits as its factorization.
13112013330133 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 13112013330133 its reverse (33103331021131), we get a palindrome (46215344351264).
The spelling of 13112013330133 in words is "thirteen trillion, one hundred twelve billion, thirteen million, three hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •