Base | Representation |
---|---|
bin | 110100101010101001… |
… | …0110001001010101001 |
3 | 101210221010212001102001 |
4 | 1221111102301022221 |
5 | 3323112113224113 |
6 | 123542452211001 |
7 | 11112504161116 |
oct | 1512522611251 |
9 | 353833761361 |
10 | 113100133033 |
11 | 43a69092a28 |
12 | 19b05009a61 |
13 | a885870654 |
14 | 568cc1390d |
15 | 2e1e36a7dd |
hex | 1a554b12a9 |
113100133033 has 2 divisors, whose sum is σ = 113100133034. Its totient is φ = 113100133032.
The previous prime is 113100133019. The next prime is 113100133049. The reversal of 113100133033 is 330331001311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67307556969 + 45792576064 = 259437^2 + 213992^2 .
It is a cyclic number.
It is not a de Polignac number, because 113100133033 - 217 = 113100001961 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113100133033.
It is not a weakly prime, because it can be changed into another prime (113100133063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56550066516 + 56550066517.
It is an arithmetic number, because the mean of its divisors is an integer number (56550066517).
Almost surely, 2113100133033 is an apocalyptic number.
It is an amenable number.
113100133033 is a deficient number, since it is larger than the sum of its proper divisors (1).
113100133033 is an equidigital number, since it uses as much as digits as its factorization.
113100133033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 113100133033 its reverse (330331001311), we get a palindrome (443431134344).
The spelling of 113100133033 in words is "one hundred thirteen billion, one hundred million, one hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •