Base | Representation |
---|---|
bin | 11000100111111110… |
… | …01000110010000101 |
3 | 1021010100011202120011 |
4 | 30103333020302011 |
5 | 204033334020122 |
6 | 10023455110221 |
7 | 645416005363 |
oct | 142377106205 |
9 | 37110152504 |
10 | 13220220037 |
11 | 5674518a92 |
12 | 268b512371 |
13 | 1328bb860b |
14 | 8d5ad2633 |
15 | 525952377 |
hex | 313fc8c85 |
13220220037 has 2 divisors, whose sum is σ = 13220220038. Its totient is φ = 13220220036.
The previous prime is 13220219963. The next prime is 13220220047. The reversal of 13220220037 is 73002202231.
13220220037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12821259361 + 398960676 = 113231^2 + 19974^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13220220037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13220220047) 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, 6610110018 + 6610110019.
It is an arithmetic number, because the mean of its divisors is an integer number (6610110019).
Almost surely, 213220220037 is an apocalyptic number.
It is an amenable number.
13220220037 is a deficient number, since it is larger than the sum of its proper divisors (1).
13220220037 is an equidigital number, since it uses as much as digits as its factorization.
13220220037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 22.
Adding to 13220220037 its reverse (73002202231), we get a palindrome (86222422268).
The spelling of 13220220037 in words is "thirteen billion, two hundred twenty million, two hundred twenty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •