Base | Representation |
---|---|
bin | 101101111100011010111… |
… | …001000101111010100001 |
3 | 102011211102022220111111212 |
4 | 231330122321011322201 |
5 | 403212023021332414 |
6 | 10414231022315505 |
7 | 444050436235544 |
oct | 55743271057241 |
9 | 12154368814455 |
10 | 3157252136609 |
11 | 1007a8a58145a |
12 | 42ba91428b95 |
13 | 19b95c6c534c |
14 | acb518b885b |
15 | 571d9d4483e |
hex | 2df1ae45ea1 |
3157252136609 has 2 divisors, whose sum is σ = 3157252136610. Its totient is φ = 3157252136608.
The previous prime is 3157252136581. The next prime is 3157252136617. The reversal of 3157252136609 is 9066312527513.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2448060778384 + 709191358225 = 1564628^2 + 842135^2 .
It is an emirp because it is prime and its reverse (9066312527513) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3157252136609 - 212 = 3157252132513 is a prime.
It is not a weakly prime, because it can be changed into another prime (3157252136669) 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, 1578626068304 + 1578626068305.
It is an arithmetic number, because the mean of its divisors is an integer number (1578626068305).
Almost surely, 23157252136609 is an apocalyptic number.
It is an amenable number.
3157252136609 is a deficient number, since it is larger than the sum of its proper divisors (1).
3157252136609 is an equidigital number, since it uses as much as digits as its factorization.
3157252136609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2041200, while the sum is 50.
The spelling of 3157252136609 in words is "three trillion, one hundred fifty-seven billion, two hundred fifty-two million, one hundred thirty-six thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •