Base | Representation |
---|---|
bin | 1100000111111010001111… |
… | …1000100001000011111101 |
3 | 1202012100010220212002221102 |
4 | 3001332203320201003331 |
5 | 3221344401423134211 |
6 | 44203422125342445 |
7 | 2544030434113412 |
oct | 301764370410375 |
9 | 52170126762842 |
10 | 13330033021181 |
11 | 427a265144358 |
12 | 15b3549107a25 |
13 | 75902a971276 |
14 | 341269b2a109 |
15 | 181b287e3a3b |
hex | c1fa3e210fd |
13330033021181 has 2 divisors, whose sum is σ = 13330033021182. Its totient is φ = 13330033021180.
The previous prime is 13330033021141. The next prime is 13330033021247. The reversal of 13330033021181 is 18112033003331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13308881681956 + 21151339225 = 3648134^2 + 145435^2 .
It is a cyclic number.
It is not a de Polignac number, because 13330033021181 - 230 = 13328959279357 is a prime.
It is a super-2 number, since 2×133300330211812 (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 (13330033021141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665016510590 + 6665016510591.
It is an arithmetic number, because the mean of its divisors is an integer number (6665016510591).
Almost surely, 213330033021181 is an apocalyptic number.
It is an amenable number.
13330033021181 is a deficient number, since it is larger than the sum of its proper divisors (1).
13330033021181 is an equidigital number, since it uses as much as digits as its factorization.
13330033021181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 29.
The spelling of 13330033021181 in words is "thirteen trillion, three hundred thirty billion, thirty-three million, twenty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •