Base | Representation |
---|---|
bin | 100100100100001011101… |
… | …1100101100001010001101 |
3 | 122210102201002112010201001 |
4 | 1021020113130230022031 |
5 | 1124314213303230242 |
6 | 14404404000020301 |
7 | 1026036462550063 |
oct | 111102734541215 |
9 | 18712632463631 |
10 | 5025505133197 |
11 | 16683396a663a |
12 | 691b87601691 |
13 | 2a5b9815c163 |
14 | 135342c60033 |
15 | 8aad1922eb7 |
hex | 4921772c28d |
5025505133197 has 2 divisors, whose sum is σ = 5025505133198. Its totient is φ = 5025505133196.
The previous prime is 5025505133189. The next prime is 5025505133281. The reversal of 5025505133197 is 7913315055205.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4834286087401 + 191219045796 = 2198701^2 + 437286^2 .
It is a cyclic number.
It is not a de Polignac number, because 5025505133197 - 23 = 5025505133189 is a prime.
It is a super-2 number, since 2×50255051331972 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5025505133147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2512752566598 + 2512752566599.
It is an arithmetic number, because the mean of its divisors is an integer number (2512752566599).
Almost surely, 25025505133197 is an apocalyptic number.
It is an amenable number.
5025505133197 is a deficient number, since it is larger than the sum of its proper divisors (1).
5025505133197 is an equidigital number, since it uses as much as digits as its factorization.
5025505133197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 708750, while the sum is 46.
The spelling of 5025505133197 in words is "five trillion, twenty-five billion, five hundred five million, one hundred thirty-three thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •