Base | Representation |
---|---|
bin | 11001011000100110… |
… | …11010001000111101 |
3 | 1022011202211122021222 |
4 | 30230103122020331 |
5 | 210402303442242 |
6 | 10132151203125 |
7 | 661501452122 |
oct | 145423321075 |
9 | 38152748258 |
10 | 13628187197 |
11 | 5863835829 |
12 | 27840764a5 |
13 | 13925893c1 |
14 | 933d6c749 |
15 | 54b68b5d2 |
hex | 32c4da23d |
13628187197 has 2 divisors, whose sum is σ = 13628187198. Its totient is φ = 13628187196.
The previous prime is 13628187179. The next prime is 13628187227. The reversal of 13628187197 is 79178182631.
13628187197 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (13628187179) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8435687716 + 5192499481 = 91846^2 + 72059^2 .
It is a cyclic number.
It is not a de Polignac number, because 13628187197 - 214 = 13628170813 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13628187697) 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, 6814093598 + 6814093599.
It is an arithmetic number, because the mean of its divisors is an integer number (6814093599).
Almost surely, 213628187197 is an apocalyptic number.
It is an amenable number.
13628187197 is a deficient number, since it is larger than the sum of its proper divisors (1).
13628187197 is an equidigital number, since it uses as much as digits as its factorization.
13628187197 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1016064, while the sum is 53.
The spelling of 13628187197 in words is "thirteen billion, six hundred twenty-eight million, one hundred eighty-seven thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •