Base | Representation |
---|---|
bin | 10001100000011111000… |
… | …001100000010100110010 |
3 | 11021000102220020002220110 |
4 | 101200133001200110302 |
5 | 124202433000043442 |
6 | 2320411323122150 |
7 | 152631135403161 |
oct | 21403701402462 |
9 | 4230386202813 |
10 | 1203111331122 |
11 | 424266a88228 |
12 | 175207673356 |
13 | 895b707c43c |
14 | 423338313d8 |
15 | 21467e2169c |
hex | 1181f060532 |
1203111331122 has 8 divisors (see below), whose sum is σ = 2406222662256. Its totient is φ = 401037110372.
The previous prime is 1203111331117. The next prime is 1203111331127. The reversal of 1203111331122 is 2211331113021.
It is an interprime number because it is at equal distance from previous prime (1203111331117) and next prime (1203111331127).
It is a sphenic number, since it is the product of 3 distinct primes.
1203111331122 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (1203111331127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 100259277588 + ... + 100259277599.
It is an arithmetic number, because the mean of its divisors is an integer number (300777832782).
Almost surely, 21203111331122 is an apocalyptic number.
1203111331122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1203111331122 is a wasteful number, since it uses less digits than its factorization.
1203111331122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200518555192.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1203111331122 its reverse (2211331113021), we get a palindrome (3414442444143).
The spelling of 1203111331122 in words is "one trillion, two hundred three billion, one hundred eleven million, three hundred thirty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •