Base | Representation |
---|---|
bin | 100101011110101001011… |
… | …0101011100110010001011 |
3 | 200020102202220202011210221 |
4 | 1022331102311130302023 |
5 | 1133343330203444042 |
6 | 14542210124450511 |
7 | 1041102646406521 |
oct | 112752265346213 |
9 | 20212686664727 |
10 | 5151055531147 |
11 | 17066066178a9 |
12 | 6b23860a9a37 |
13 | 2b4986224766 |
14 | 13b4533bc311 |
15 | 8decdd00d67 |
hex | 4af52d5cc8b |
5151055531147 has 2 divisors, whose sum is σ = 5151055531148. Its totient is φ = 5151055531146.
The previous prime is 5151055531103. The next prime is 5151055531177. The reversal of 5151055531147 is 7411355501515.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5151055531147 - 211 = 5151055529099 is a prime.
It is not a weakly prime, because it can be changed into another prime (5151055531177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2575527765573 + 2575527765574.
It is an arithmetic number, because the mean of its divisors is an integer number (2575527765574).
Almost surely, 25151055531147 is an apocalyptic number.
5151055531147 is a deficient number, since it is larger than the sum of its proper divisors (1).
5151055531147 is an equidigital number, since it uses as much as digits as its factorization.
5151055531147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 262500, while the sum is 43.
The spelling of 5151055531147 in words is "five trillion, one hundred fifty-one billion, fifty-five million, five hundred thirty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •