Base | Representation |
---|---|
bin | 10000011101100001000… |
… | …010010101001110111001 |
3 | 11000010211120122112101101 |
4 | 100131201002111032321 |
5 | 122013201311300212 |
6 | 2223400152051401 |
7 | 144504204515554 |
oct | 20354102251671 |
9 | 4003746575341 |
10 | 1131204400057 |
11 | 3a6817436676 |
12 | 16329a093b61 |
13 | 82897845514 |
14 | 3ca7186969b |
15 | 1e65a1d4157 |
hex | 107610953b9 |
1131204400057 has 2 divisors, whose sum is σ = 1131204400058. Its totient is φ = 1131204400056.
The previous prime is 1131204400021. The next prime is 1131204400153. The reversal of 1131204400057 is 7500044021311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 846282244096 + 284922155961 = 919936^2 + 533781^2 .
It is an emirp because it is prime and its reverse (7500044021311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1131204400057 - 231 = 1129056916409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1131204399998 and 1131204400034.
It is not a weakly prime, because it can be changed into another prime (1131204400757) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565602200028 + 565602200029.
It is an arithmetic number, because the mean of its divisors is an integer number (565602200029).
Almost surely, 21131204400057 is an apocalyptic number.
It is an amenable number.
1131204400057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1131204400057 is an equidigital number, since it uses as much as digits as its factorization.
1131204400057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3360, while the sum is 28.
Adding to 1131204400057 its reverse (7500044021311), we get a palindrome (8631248421368).
The spelling of 1131204400057 in words is "one trillion, one hundred thirty-one billion, two hundred four million, four hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •