Base | Representation |
---|---|
bin | 11110000001001001110… |
… | …00110001001110111001 |
3 | 10122121020210210012011202 |
4 | 33000210320301032321 |
5 | 113344312204400122 |
6 | 2105453525303545 |
7 | 134342216645033 |
oct | 17004470611671 |
9 | 3577223705152 |
10 | 1031411012537 |
11 | 36846769a594 |
12 | 147a89564bb5 |
13 | 76352a96aa9 |
14 | 37cc602cc53 |
15 | 1bc691ace92 |
hex | f024e313b9 |
1031411012537 has 2 divisors, whose sum is σ = 1031411012538. Its totient is φ = 1031411012536.
The previous prime is 1031411012503. The next prime is 1031411012551. The reversal of 1031411012537 is 7352101141301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 951036494521 + 80374518016 = 975211^2 + 283504^2 .
It is a cyclic number.
It is not a de Polignac number, because 1031411012537 - 218 = 1031410750393 is a prime.
It is not a weakly prime, because it can be changed into another prime (1031411011537) 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, 515705506268 + 515705506269.
It is an arithmetic number, because the mean of its divisors is an integer number (515705506269).
Almost surely, 21031411012537 is an apocalyptic number.
It is an amenable number.
1031411012537 is a deficient number, since it is larger than the sum of its proper divisors (1).
1031411012537 is an equidigital number, since it uses as much as digits as its factorization.
1031411012537 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 29.
Adding to 1031411012537 its reverse (7352101141301), we get a palindrome (8383512153838).
The spelling of 1031411012537 in words is "one trillion, thirty-one billion, four hundred eleven million, twelve thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •