Base | Representation |
---|---|
bin | 10000000011100011100… |
… | …110110100111100010011 |
3 | 10220110212222111012010121 |
4 | 100003203212310330103 |
5 | 121034110014443011 |
6 | 2202510220011111 |
7 | 142466360151646 |
oct | 20034346647423 |
9 | 3813788435117 |
10 | 1103330234131 |
11 | 395a13176204 |
12 | 1599bb090a97 |
13 | 80074a15008 |
14 | 3b5898b3a5d |
15 | 1da78026e71 |
hex | 100e39b4f13 |
1103330234131 has 2 divisors, whose sum is σ = 1103330234132. Its totient is φ = 1103330234130.
The previous prime is 1103330234087. The next prime is 1103330234207. The reversal of 1103330234131 is 1314320333011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1103330234131 - 217 = 1103330103059 is a prime.
It is a super-2 number, since 2×11033302341312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1103330234096 and 1103330234105.
It is not a weakly prime, because it can be changed into another prime (1103330234231) 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, 551665117065 + 551665117066.
It is an arithmetic number, because the mean of its divisors is an integer number (551665117066).
Almost surely, 21103330234131 is an apocalyptic number.
1103330234131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103330234131 is an equidigital number, since it uses as much as digits as its factorization.
1103330234131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1103330234131 its reverse (1314320333011), we get a palindrome (2417650567142).
The spelling of 1103330234131 in words is "one trillion, one hundred three billion, three hundred thirty million, two hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •