Base | Representation |
---|---|
bin | 11001100010101000011010… |
… | …000000100000101100011111 |
3 | 112201201201222021222202000021 |
4 | 121202220122000200230133 |
5 | 104210412402304013434 |
6 | 1034524053135213011 |
7 | 32442435112226251 |
oct | 3142503200405437 |
9 | 481651867882007 |
10 | 112331011001119 |
11 | 32879350279419 |
12 | 10722604377167 |
13 | 4a8a9cc318b21 |
14 | 1da4bc834dcd1 |
15 | cebec262dcb4 |
hex | 662a1a020b1f |
112331011001119 has 2 divisors, whose sum is σ = 112331011001120. Its totient is φ = 112331011001118.
The previous prime is 112331011001113. The next prime is 112331011001129. The reversal of 112331011001119 is 911100110133211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112331011001119 - 213 = 112331010992927 is a prime.
It is a super-2 number, since 2×1123310110011192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112331011001093 and 112331011001102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112331011001113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56165505500559 + 56165505500560.
It is an arithmetic number, because the mean of its divisors is an integer number (56165505500560).
Almost surely, 2112331011001119 is an apocalyptic number.
112331011001119 is a deficient number, since it is larger than the sum of its proper divisors (1).
112331011001119 is an equidigital number, since it uses as much as digits as its factorization.
112331011001119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 25.
The spelling of 112331011001119 in words is "one hundred twelve trillion, three hundred thirty-one billion, eleven million, one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •