Base | Representation |
---|---|
bin | 110100110000101100… |
… | …1110111110110101111 |
3 | 101211110022012010022111 |
4 | 1221201121313312233 |
5 | 3324021122301111 |
6 | 124014551224451 |
7 | 11120522226634 |
oct | 1514131676657 |
9 | 354408163274 |
10 | 113303322031 |
11 | 44062853919 |
12 | 19b61078127 |
13 | a8b89a3323 |
14 | 56abbc618b |
15 | 2e32104a21 |
hex | 1a61677daf |
113303322031 has 2 divisors, whose sum is σ = 113303322032. Its totient is φ = 113303322030.
The previous prime is 113303322029. The next prime is 113303322043. The reversal of 113303322031 is 130223303311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113303322031 - 21 = 113303322029 is a prime.
It is a super-2 number, since 2×1133033220312 (a number of 23 digits) contains 22 as substring.
Together with 113303322029, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 113303321993 and 113303322011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113303322091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56651661015 + 56651661016.
It is an arithmetic number, because the mean of its divisors is an integer number (56651661016).
Almost surely, 2113303322031 is an apocalyptic number.
113303322031 is a deficient number, since it is larger than the sum of its proper divisors (1).
113303322031 is an equidigital number, since it uses as much as digits as its factorization.
113303322031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 113303322031 its reverse (130223303311), we get a palindrome (243526625342).
The spelling of 113303322031 in words is "one hundred thirteen billion, three hundred three million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •