Base | Representation |
---|---|
bin | 1101100010001… |
… | …01101010001101 |
3 | 21220121222222121 |
4 | 12301011222031 |
5 | 213031002113 |
6 | 15133212541 |
7 | 2546000503 |
oct | 661055215 |
9 | 256558877 |
10 | 113531533 |
11 | 590a3a15 |
12 | 32031151 |
13 | 1a6a092b |
14 | 11114673 |
15 | 9e78e8d |
hex | 6c45a8d |
113531533 has 2 divisors, whose sum is σ = 113531534. Its totient is φ = 113531532.
The previous prime is 113531531. The next prime is 113531557. The reversal of 113531533 is 335135311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107785924 + 5745609 = 10382^2 + 2397^2 .
It is a cyclic number.
It is not a de Polignac number, because 113531533 - 21 = 113531531 is a prime.
Together with 113531531, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 113531498 and 113531507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113531531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56765766 + 56765767.
It is an arithmetic number, because the mean of its divisors is an integer number (56765767).
Almost surely, 2113531533 is an apocalyptic number.
It is an amenable number.
113531533 is a deficient number, since it is larger than the sum of its proper divisors (1).
113531533 is an equidigital number, since it uses as much as digits as its factorization.
113531533 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2025, while the sum is 25.
The square root of 113531533 is about 10655.1176905748. The cubic root of 113531533 is about 484.2156635708.
Adding to 113531533 its reverse (335135311), we get a palindrome (448666844).
The spelling of 113531533 in words is "one hundred thirteen million, five hundred thirty-one thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •