Base | Representation |
---|---|
bin | 1100000000111111010011… |
… | …1000111011111001101001 |
3 | 1201202222020120111021112011 |
4 | 3000033310320323321221 |
5 | 3212422400022020241 |
6 | 44033035525315521 |
7 | 2532321122452243 |
oct | 300176470737151 |
9 | 51688216437464 |
10 | 13211133001321 |
11 | 42338a0190632 |
12 | 15944a5865ba1 |
13 | 74aa5c62b828 |
14 | 3395ca919093 |
15 | 17d9ba1bd281 |
hex | c03f4e3be69 |
13211133001321 has 2 divisors, whose sum is σ = 13211133001322. Its totient is φ = 13211133001320.
The previous prime is 13211133001277. The next prime is 13211133001369. The reversal of 13211133001321 is 12310033111231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12971263246096 + 239869755225 = 3601564^2 + 489765^2 .
It is a cyclic number.
It is not a de Polignac number, because 13211133001321 - 219 = 13211132477033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13211133001292 and 13211133001301.
It is not a weakly prime, because it can be changed into another prime (13211133008321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6605566500660 + 6605566500661.
It is an arithmetic number, because the mean of its divisors is an integer number (6605566500661).
Almost surely, 213211133001321 is an apocalyptic number.
It is an amenable number.
13211133001321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13211133001321 is an equidigital number, since it uses as much as digits as its factorization.
13211133001321 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 13211133001321 its reverse (12310033111231), we get a palindrome (25521166112552).
The spelling of 13211133001321 in words is "thirteen trillion, two hundred eleven billion, one hundred thirty-three million, one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •