Base | Representation |
---|---|
bin | 1011000010010000000110… |
… | …1000011111000000011101 |
3 | 1120221221012020100211102121 |
4 | 2300210001220133000131 |
5 | 3042243004330014211 |
6 | 41445544330022541 |
7 | 2361413506225045 |
oct | 260440150370035 |
9 | 46857166324377 |
10 | 12133310001181 |
11 | 39587871a98a6 |
12 | 143b624b77a51 |
13 | 6a02212689a5 |
14 | 2dd380908725 |
15 | 160936660271 |
hex | b0901a1f01d |
12133310001181 has 2 divisors, whose sum is σ = 12133310001182. Its totient is φ = 12133310001180.
The previous prime is 12133310001119. The next prime is 12133310001221. The reversal of 12133310001181 is 18110001333121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12023660275225 + 109649725956 = 3467515^2 + 331134^2 .
It is a cyclic number.
It is not a de Polignac number, because 12133310001181 - 213 = 12133309992989 is a prime.
It is a super-2 number, since 2×121333100011812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12133310011181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6066655000590 + 6066655000591.
It is an arithmetic number, because the mean of its divisors is an integer number (6066655000591).
Almost surely, 212133310001181 is an apocalyptic number.
It is an amenable number.
12133310001181 is a deficient number, since it is larger than the sum of its proper divisors (1).
12133310001181 is an equidigital number, since it uses as much as digits as its factorization.
12133310001181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 12133310001181 in words is "twelve trillion, one hundred thirty-three billion, three hundred ten million, one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •