Base | Representation |
---|---|
bin | 100101011110111011001… |
… | …0110111011111110001111 |
3 | 200020111022110012011010112 |
4 | 1022331312112323332033 |
5 | 1133401040241342312 |
6 | 14542345214430235 |
7 | 1041123504226604 |
oct | 112756626737617 |
9 | 20214273164115 |
10 | 5151651512207 |
11 | 1706891a80232 |
12 | 6b251180237b |
13 | 2b4a4c843c85 |
14 | 13b4ac5da6ab |
15 | 8e0162c7d22 |
hex | 4af765bbf8f |
5151651512207 has 2 divisors, whose sum is σ = 5151651512208. Its totient is φ = 5151651512206.
The previous prime is 5151651512179. The next prime is 5151651512209. The reversal of 5151651512207 is 7022151561515.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5151651512207 - 228 = 5151383076751 is a prime.
Together with 5151651512209, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5151651512209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2575825756103 + 2575825756104.
It is an arithmetic number, because the mean of its divisors is an integer number (2575825756104).
Almost surely, 25151651512207 is an apocalyptic number.
5151651512207 is a deficient number, since it is larger than the sum of its proper divisors (1).
5151651512207 is an equidigital number, since it uses as much as digits as its factorization.
5151651512207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105000, while the sum is 41.
The spelling of 5151651512207 in words is "five trillion, one hundred fifty-one billion, six hundred fifty-one million, five hundred twelve thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •