Base | Representation |
---|---|
bin | 11000100110111001… |
… | …10101111110101001 |
3 | 1021002201021000201022 |
4 | 30103130311332221 |
5 | 204024033330441 |
6 | 10022534302225 |
7 | 645246413615 |
oct | 142334657651 |
9 | 37081230638 |
10 | 13211230121 |
11 | 566a438801 |
12 | 26884b7975 |
13 | 132708b73b |
14 | 8d4832345 |
15 | 524c7884b |
hex | 313735fa9 |
13211230121 has 2 divisors, whose sum is σ = 13211230122. Its totient is φ = 13211230120.
The previous prime is 13211230117. The next prime is 13211230127. The reversal of 13211230121 is 12103211231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13207755625 + 3474496 = 114925^2 + 1864^2 .
It is a cyclic number.
It is not a de Polignac number, because 13211230121 - 22 = 13211230117 is a prime.
It is a super-3 number, since 3×132112301213 (a number of 31 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13211230121.
It is not a weakly prime, because it can be changed into another prime (13211230127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6605615060 + 6605615061.
It is an arithmetic number, because the mean of its divisors is an integer number (6605615061).
Almost surely, 213211230121 is an apocalyptic number.
It is an amenable number.
13211230121 is a deficient number, since it is larger than the sum of its proper divisors (1).
13211230121 is an equidigital number, since it uses as much as digits as its factorization.
13211230121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 13211230121 its reverse (12103211231), we get a palindrome (25314441352).
The spelling of 13211230121 in words is "thirteen billion, two hundred eleven million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •