Base | Representation |
---|---|
bin | 1011111010101000111000… |
… | …0001111011001011011011 |
3 | 1201101112122012211011121102 |
4 | 2332222032001323023123 |
5 | 3204130430434401021 |
6 | 43510554012302015 |
7 | 2521406411002331 |
oct | 276521601731333 |
9 | 51345565734542 |
10 | 13102033122011 |
11 | 41a15a5145519 |
12 | 157731847190b |
13 | 74069376b222 |
14 | 3341db0c3b51 |
15 | 17ac3212800b |
hex | bea8e07b2db |
13102033122011 has 2 divisors, whose sum is σ = 13102033122012. Its totient is φ = 13102033122010.
The previous prime is 13102033121939. The next prime is 13102033122029. The reversal of 13102033122011 is 11022133020131.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13102033122011 - 210 = 13102033120987 is a prime.
It is a super-2 number, since 2×131020331220112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13102033122811) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551016561005 + 6551016561006.
It is an arithmetic number, because the mean of its divisors is an integer number (6551016561006).
Almost surely, 213102033122011 is an apocalyptic number.
13102033122011 is a deficient number, since it is larger than the sum of its proper divisors (1).
13102033122011 is an equidigital number, since it uses as much as digits as its factorization.
13102033122011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13102033122011 its reverse (11022133020131), we get a palindrome (24124166142142).
The spelling of 13102033122011 in words is "thirteen trillion, one hundred two billion, thirty-three million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •