Base | Representation |
---|---|
bin | 11001100010010111111011… |
… | …100010101101011100000011 |
3 | 112201200001022101020221022222 |
4 | 121202113323202231130003 |
5 | 104210120134410101311 |
6 | 1034512005451521255 |
7 | 32441240525226236 |
oct | 3142277342553403 |
9 | 481601271227288 |
10 | 112313320003331 |
11 | 328718a2159997 |
12 | 1071b0a775922b |
13 | 4a891401189b5 |
14 | 1da3dca99b41d |
15 | ceb7d9461adb |
hex | 6625fb8ad703 |
112313320003331 has 2 divisors, whose sum is σ = 112313320003332. Its totient is φ = 112313320003330.
The previous prime is 112313320003319. The next prime is 112313320003337. The reversal of 112313320003331 is 133300023313211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112313320003331 - 222 = 112313315809027 is a prime.
It is a super-2 number, since 2×1123133200033312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112313320003331.
It is not a weakly prime, because it can be changed into another prime (112313320003337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56156660001665 + 56156660001666.
It is an arithmetic number, because the mean of its divisors is an integer number (56156660001666).
Almost surely, 2112313320003331 is an apocalyptic number.
112313320003331 is a deficient number, since it is larger than the sum of its proper divisors (1).
112313320003331 is an equidigital number, since it uses as much as digits as its factorization.
112313320003331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 112313320003331 its reverse (133300023313211), we get a palindrome (245613343316542).
The spelling of 112313320003331 in words is "one hundred twelve trillion, three hundred thirteen billion, three hundred twenty million, three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •