Base | Representation |
---|---|
bin | 1011111010101001100111… |
… | …0001011000001110011101 |
3 | 1201101120010221111020212211 |
4 | 2332222121301120032131 |
5 | 3204131331402024013 |
6 | 43511025330400421 |
7 | 2521414322246542 |
oct | 276523161301635 |
9 | 51346127436784 |
10 | 13102230111133 |
11 | 41a1696361349 |
12 | 1577372430111 |
13 | 7406c550cc37 |
14 | 334219320bc9 |
15 | 17ac4458a23d |
hex | bea99c5839d |
13102230111133 has 2 divisors, whose sum is σ = 13102230111134. Its totient is φ = 13102230111132.
The previous prime is 13102230111067. The next prime is 13102230111137. The reversal of 13102230111133 is 33111103220131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9590436566649 + 3511793544484 = 3096843^2 + 1873978^2 .
It is an emirp because it is prime and its reverse (33111103220131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13102230111133 - 221 = 13102228013981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13102230111137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551115055566 + 6551115055567.
It is an arithmetic number, because the mean of its divisors is an integer number (6551115055567).
Almost surely, 213102230111133 is an apocalyptic number.
It is an amenable number.
13102230111133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13102230111133 is an equidigital number, since it uses as much as digits as its factorization.
13102230111133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13102230111133 its reverse (33111103220131), we get a palindrome (46213333331264).
The spelling of 13102230111133 in words is "thirteen trillion, one hundred two billion, two hundred thirty million, one hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •