Base | Representation |
---|---|
bin | 10000011101101110100… |
… | …000110111100000011101 |
3 | 11000011102100010000221212 |
4 | 100131232200313200131 |
5 | 122014132202233243 |
6 | 2223434430234205 |
7 | 144512621433221 |
oct | 20355640674035 |
9 | 4004370100855 |
10 | 1131430508573 |
11 | 3a6923031312 |
12 | 163341955965 |
13 | 82902641441 |
14 | 3ca938c6781 |
15 | 1e66ee99318 |
hex | 1076e83781d |
1131430508573 has 2 divisors, whose sum is σ = 1131430508574. Its totient is φ = 1131430508572.
The previous prime is 1131430508531. The next prime is 1131430508623. The reversal of 1131430508573 is 3758050341311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 940952380729 + 190478127844 = 970027^2 + 436438^2 .
It is a cyclic number.
It is not a de Polignac number, because 1131430508573 - 228 = 1131162073117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1131430508573.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1131430507573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565715254286 + 565715254287.
It is an arithmetic number, because the mean of its divisors is an integer number (565715254287).
Almost surely, 21131430508573 is an apocalyptic number.
It is an amenable number.
1131430508573 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131430508573 is an equidigital number, since it uses as much as digits as its factorization.
1131430508573 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 151200, while the sum is 41.
Adding to 1131430508573 its reverse (3758050341311), we get a palindrome (4889480849884).
The spelling of 1131430508573 in words is "one trillion, one hundred thirty-one billion, four hundred thirty million, five hundred eight thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •