Base | Representation |
---|---|
bin | 1100000111011001011011… |
… | …0101100010000010110001 |
3 | 1202011111102000111122110202 |
4 | 3001312112311202002301 |
5 | 3221223331343402434 |
6 | 44155404054004545 |
7 | 2543266232301161 |
oct | 301662665420261 |
9 | 52144360448422 |
10 | 13321224200369 |
11 | 4276554860958 |
12 | 15b18ab046755 |
13 | 7582559aa367 |
14 | 340a71c7c5a1 |
15 | 1817b02cca7e |
hex | c1d96d620b1 |
13321224200369 has 2 divisors, whose sum is σ = 13321224200370. Its totient is φ = 13321224200368.
The previous prime is 13321224200353. The next prime is 13321224200371. The reversal of 13321224200369 is 96300242212331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10272428833969 + 3048795366400 = 3205063^2 + 1746080^2 .
It is a cyclic number.
It is not a de Polignac number, because 13321224200369 - 24 = 13321224200353 is a prime.
It is a super-2 number, since 2×133212242003692 (a number of 27 digits) contains 22 as substring.
Together with 13321224200371, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13321224200329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660612100184 + 6660612100185.
It is an arithmetic number, because the mean of its divisors is an integer number (6660612100185).
Almost surely, 213321224200369 is an apocalyptic number.
It is an amenable number.
13321224200369 is a deficient number, since it is larger than the sum of its proper divisors (1).
13321224200369 is an equidigital number, since it uses as much as digits as its factorization.
13321224200369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 93312, while the sum is 38.
The spelling of 13321224200369 in words is "thirteen trillion, three hundred twenty-one billion, two hundred twenty-four million, two hundred thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •