Base | Representation |
---|---|
bin | 1001101101100101… |
… | …10111101010110001 |
3 | 111110101120110201202 |
4 | 10312302313222301 |
5 | 41134323202202 |
6 | 2221223540545 |
7 | 243133403462 |
oct | 46662675261 |
9 | 14411513652 |
10 | 5214272177 |
11 | 2236358954 |
12 | 10162ba755 |
13 | 65137216a |
14 | 37671ad69 |
15 | 207b7e802 |
hex | 136cb7ab1 |
5214272177 has 2 divisors, whose sum is σ = 5214272178. Its totient is φ = 5214272176.
The previous prime is 5214272159. The next prime is 5214272179. The reversal of 5214272177 is 7712724125.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5214139681 + 132496 = 72209^2 + 364^2 .
It is a cyclic number.
It is not a de Polignac number, because 5214272177 - 220 = 5213223601 is a prime.
Together with 5214272179, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5214272177.
It is not a weakly prime, because it can be changed into another prime (5214272179) 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, 2607136088 + 2607136089.
It is an arithmetic number, because the mean of its divisors is an integer number (2607136089).
Almost surely, 25214272177 is an apocalyptic number.
It is an amenable number.
5214272177 is a deficient number, since it is larger than the sum of its proper divisors (1).
5214272177 is an equidigital number, since it uses as much as digits as its factorization.
5214272177 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 54880, while the sum is 38.
The square root of 5214272177 is about 72209.9174421353. The cubic root of 5214272177 is about 1734.0617778924.
The spelling of 5214272177 in words is "five billion, two hundred fourteen million, two hundred seventy-two thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •