Base | Representation |
---|---|
bin | 11000110100100000… |
… | …00011111110111001 |
3 | 1021101122221101202212 |
4 | 30122100003332321 |
5 | 204242240220441 |
6 | 10042131504505 |
7 | 651133231541 |
oct | 143220037671 |
9 | 37348841685 |
10 | 13325320121 |
11 | 5718883263 |
12 | 26ba758135 |
13 | 13448c6609 |
14 | 905a50321 |
15 | 52ecb2eeb |
hex | 31a403fb9 |
13325320121 has 2 divisors, whose sum is σ = 13325320122. Its totient is φ = 13325320120.
The previous prime is 13325320111. The next prime is 13325320139. The reversal of 13325320121 is 12102352331.
13325320121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8655511225 + 4669808896 = 93035^2 + 68336^2 .
It is a cyclic number.
It is not a de Polignac number, because 13325320121 - 226 = 13258211257 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (13325320111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6662660060 + 6662660061.
It is an arithmetic number, because the mean of its divisors is an integer number (6662660061).
Almost surely, 213325320121 is an apocalyptic number.
It is an amenable number.
13325320121 is a deficient number, since it is larger than the sum of its proper divisors (1).
13325320121 is an equidigital number, since it uses as much as digits as its factorization.
13325320121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 13325320121 its reverse (12102352331), we get a palindrome (25427672452).
The spelling of 13325320121 in words is "thirteen billion, three hundred twenty-five million, three hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •