Base | Representation |
---|---|
bin | 10110011010000111011… |
… | …101111010100001001101 |
3 | 12110012200021001202001022 |
4 | 112122013131322201031 |
5 | 200212123442323442 |
6 | 3135223524523525 |
7 | 216152304013106 |
oct | 26320735724115 |
9 | 5405607052038 |
10 | 1539871057997 |
11 | 544068082398 |
12 | 20a52b8505a5 |
13 | b2294860b0c |
14 | 5475ca713ad |
15 | 2a0c78b13d2 |
hex | 1668777a84d |
1539871057997 has 2 divisors, whose sum is σ = 1539871057998. Its totient is φ = 1539871057996.
The previous prime is 1539871057979. The next prime is 1539871058023. The reversal of 1539871057997 is 7997501789351.
Together with previous prime (1539871057979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1007465883076 + 532405174921 = 1003726^2 + 729661^2 .
It is a cyclic number.
It is not a de Polignac number, because 1539871057997 - 28 = 1539871057741 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1539871057997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1539871057927) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 769935528998 + 769935528999.
It is an arithmetic number, because the mean of its divisors is an integer number (769935528999).
Almost surely, 21539871057997 is an apocalyptic number.
It is an amenable number.
1539871057997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1539871057997 is an equidigital number, since it uses as much as digits as its factorization.
1539871057997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 150028200, while the sum is 71.
The spelling of 1539871057997 in words is "one trillion, five hundred thirty-nine billion, eight hundred seventy-one million, fifty-seven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •