Base | Representation |
---|---|
bin | 1100000111010100110111… |
… | …1111101000011101011001 |
3 | 1202011101020211221002110102 |
4 | 3001311031333220131121 |
5 | 3221213331020030241 |
6 | 44155042520225145 |
7 | 2543224032563303 |
oct | 301651577503531 |
9 | 52141224832412 |
10 | 13320002111321 |
11 | 4275a87a38304 |
12 | 15b160990b1b5 |
13 | 7580bc750949 |
14 | 34099783c973 |
15 | 18173cd7c39b |
hex | c1d4dfe8759 |
13320002111321 has 2 divisors, whose sum is σ = 13320002111322. Its totient is φ = 13320002111320.
The previous prime is 13320002111279. The next prime is 13320002111389. The reversal of 13320002111321 is 12311120002331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12938157211225 + 381844900096 = 3596965^2 + 617936^2 .
It is a cyclic number.
It is not a de Polignac number, because 13320002111321 - 210 = 13320002110297 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13320002111293 and 13320002111302.
It is not a weakly prime, because it can be changed into another prime (13320002111021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660001055660 + 6660001055661.
It is an arithmetic number, because the mean of its divisors is an integer number (6660001055661).
Almost surely, 213320002111321 is an apocalyptic number.
It is an amenable number.
13320002111321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320002111321 is an equidigital number, since it uses as much as digits as its factorization.
13320002111321 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 13320002111321 its reverse (12311120002331), we get a palindrome (25631122113652).
The spelling of 13320002111321 in words is "thirteen trillion, three hundred twenty billion, two million, one hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •