Base | Representation |
---|---|
bin | 110100101000101000… |
… | …0011101111001011101 |
3 | 101210202102102220220101 |
4 | 1221101100131321131 |
5 | 3322442244432312 |
6 | 123532033021101 |
7 | 11111022503611 |
oct | 1512120357135 |
9 | 353672386811 |
10 | 113032420957 |
11 | 43a33944935 |
12 | 19aa63b4791 |
13 | a874823331 |
14 | 5683c29341 |
15 | 2e18442a57 |
hex | 1a5141de5d |
113032420957 has 2 divisors, whose sum is σ = 113032420958. Its totient is φ = 113032420956.
The previous prime is 113032420939. The next prime is 113032420967. The reversal of 113032420957 is 759024230311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96341331321 + 16691089636 = 310389^2 + 129194^2 .
It is a cyclic number.
It is not a de Polignac number, because 113032420957 - 231 = 110884937309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113032420967) 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, 56516210478 + 56516210479.
It is an arithmetic number, because the mean of its divisors is an integer number (56516210479).
Almost surely, 2113032420957 is an apocalyptic number.
It is an amenable number.
113032420957 is a deficient number, since it is larger than the sum of its proper divisors (1).
113032420957 is an equidigital number, since it uses as much as digits as its factorization.
113032420957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 37.
The spelling of 113032420957 in words is "one hundred thirteen billion, thirty-two million, four hundred twenty thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •