Base | Representation |
---|---|
bin | 11001101111100100100011… |
… | …001011011111000010011011 |
3 | 112211212202012000102211021021 |
4 | 121233210203023133002123 |
5 | 104320000004103300011 |
6 | 1040444352532423311 |
7 | 32563614450334204 |
oct | 3157444313370233 |
9 | 484782160384237 |
10 | 113220223103131 |
11 | 33091477329841 |
12 | 10846a07777b37 |
13 | 4b2380cab1131 |
14 | 1dd5c60ab85ab |
15 | d151b7a16471 |
hex | 66f9232df09b |
113220223103131 has 2 divisors, whose sum is σ = 113220223103132. Its totient is φ = 113220223103130.
The previous prime is 113220223103123. The next prime is 113220223103191. The reversal of 113220223103131 is 131301322022311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113220223103131 - 23 = 113220223103123 is a prime.
It is a super-2 number, since 2×1132202231031312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113220223103096 and 113220223103105.
It is not a weakly prime, because it can be changed into another prime (113220223103191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56610111551565 + 56610111551566.
It is an arithmetic number, because the mean of its divisors is an integer number (56610111551566).
Almost surely, 2113220223103131 is an apocalyptic number.
113220223103131 is a deficient number, since it is larger than the sum of its proper divisors (1).
113220223103131 is an equidigital number, since it uses as much as digits as its factorization.
113220223103131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 113220223103131 its reverse (131301322022311), we get a palindrome (244521545125442).
The spelling of 113220223103131 in words is "one hundred thirteen trillion, two hundred twenty billion, two hundred twenty-three million, one hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •