Base | Representation |
---|---|
bin | 10000000010100001011… |
… | …100000011000111001011 |
3 | 10220101000121121011022101 |
4 | 100002201130003013023 |
5 | 121024321322043311 |
6 | 2202204122134231 |
7 | 142430020241152 |
oct | 20024134030713 |
9 | 3811017534271 |
10 | 1102220112331 |
11 | 3954a3578278 |
12 | 15974b351377 |
13 | 7cc28a2c200 |
14 | 3b4c229c599 |
15 | 1da10841ec1 |
hex | 100a17031cb |
1102220112331 has 6 divisors (see below), whose sum is σ = 1193528287500. Its totient is φ = 1017433949688.
The previous prime is 1102220112307. The next prime is 1102220112353. The reversal of 1102220112331 is 1332110222011.
It is a de Polignac number, because none of the positive numbers 2k-1102220112331 is a prime.
It is a super-2 number, since 2×11022201123312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1102220112299 and 1102220112308.
It is not an unprimeable number, because it can be changed into a prime (1102220110331) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3261006081 + ... + 3261006418.
It is an arithmetic number, because the mean of its divisors is an integer number (198921381250).
Almost surely, 21102220112331 is an apocalyptic number.
1102220112331 is a deficient number, since it is larger than the sum of its proper divisors (91308175169).
1102220112331 is an equidigital number, since it uses as much as digits as its factorization.
1102220112331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6522012525 (or 6522012512 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1102220112331 its reverse (1332110222011), we get a palindrome (2434330334342).
The spelling of 1102220112331 in words is "one trillion, one hundred two billion, two hundred twenty million, one hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.131 sec. • engine limits •