Base | Representation |
---|---|
bin | 11001101100110110011001… |
… | …101010010011000111000111 |
3 | 112211012212112022022101202221 |
4 | 121230312121222103013013 |
5 | 104303414024434044312 |
6 | 1040222430003313211 |
7 | 32544244604110636 |
oct | 3154663152230707 |
9 | 484185468271687 |
10 | 113033232331207 |
11 | 3301a140976201 |
12 | 1081672097b807 |
13 | 4b0bcaca45066 |
14 | 1dcaba268551d |
15 | d103c1718207 |
hex | 66cd99a931c7 |
113033232331207 has 2 divisors, whose sum is σ = 113033232331208. Its totient is φ = 113033232331206.
The previous prime is 113033232331171. The next prime is 113033232331273. The reversal of 113033232331207 is 702133232330311.
It is a weak prime.
It is an emirp because it is prime and its reverse (702133232330311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113033232331207 - 211 = 113033232329159 is a prime.
It is a super-2 number, since 2×1130332323312072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113033232338207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56516616165603 + 56516616165604.
It is an arithmetic number, because the mean of its divisors is an integer number (56516616165604).
Almost surely, 2113033232331207 is an apocalyptic number.
113033232331207 is a deficient number, since it is larger than the sum of its proper divisors (1).
113033232331207 is an equidigital number, since it uses as much as digits as its factorization.
113033232331207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 34.
Adding to 113033232331207 its reverse (702133232330311), we get a palindrome (815166464661518).
The spelling of 113033232331207 in words is "one hundred thirteen trillion, thirty-three billion, two hundred thirty-two million, three hundred thirty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •