Base | Representation |
---|---|
bin | 11000100111111101… |
… | …01011111101101101 |
3 | 1021010022221202122022 |
4 | 30103332223331231 |
5 | 204033321230442 |
6 | 10023452355525 |
7 | 645415004264 |
oct | 142376537555 |
9 | 37108852568 |
10 | 13220101997 |
11 | 5674448333 |
12 | 268b475ba5 |
13 | 1328b7697b |
14 | 8d5aa15db |
15 | 52592c3d2 |
hex | 313fabf6d |
13220101997 has 2 divisors, whose sum is σ = 13220101998. Its totient is φ = 13220101996.
The previous prime is 13220101981. The next prime is 13220102039. The reversal of 13220101997 is 79910102231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12586371721 + 633730276 = 112189^2 + 25174^2 .
It is a cyclic number.
It is not a de Polignac number, because 13220101997 - 24 = 13220101981 is a prime.
It is a super-2 number, since 2×132201019972 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13220001997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6610050998 + 6610050999.
It is an arithmetic number, because the mean of its divisors is an integer number (6610050999).
Almost surely, 213220101997 is an apocalyptic number.
It is an amenable number.
13220101997 is a deficient number, since it is larger than the sum of its proper divisors (1).
13220101997 is an equidigital number, since it uses as much as digits as its factorization.
13220101997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 35.
The spelling of 13220101997 in words is "thirteen billion, two hundred twenty million, one hundred one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •