Base | Representation |
---|---|
bin | 1100000111101001001001… |
… | …0011000010001010011001 |
3 | 1202011220022000221122121101 |
4 | 3001322102103002022121 |
5 | 3221311001402442241 |
6 | 44201342441511401 |
7 | 2543505620524213 |
oct | 301722223021231 |
9 | 52156260848541 |
10 | 13325443015321 |
11 | 427831a208a88 |
12 | 15b2687aa2561 |
13 | 758778a42c78 |
14 | 340d522b15b3 |
15 | 18195a876e31 |
hex | c1e924c2299 |
13325443015321 has 2 divisors, whose sum is σ = 13325443015322. Its totient is φ = 13325443015320.
The previous prime is 13325443015301. The next prime is 13325443015331. The reversal of 13325443015321 is 12351034452331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8398867686400 + 4926575328921 = 2898080^2 + 2219589^2 .
It is an emirp because it is prime and its reverse (12351034452331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13325443015321 - 25 = 13325443015289 is a prime.
It is not a weakly prime, because it can be changed into another prime (13325443015301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6662721507660 + 6662721507661.
It is an arithmetic number, because the mean of its divisors is an integer number (6662721507661).
Almost surely, 213325443015321 is an apocalyptic number.
It is an amenable number.
13325443015321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13325443015321 is an equidigital number, since it uses as much as digits as its factorization.
13325443015321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 13325443015321 its reverse (12351034452331), we get a palindrome (25676477467652).
The spelling of 13325443015321 in words is "thirteen trillion, three hundred twenty-five billion, four hundred forty-three million, fifteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •