Base | Representation |
---|---|
bin | 10000010100000000110… |
… | …100110110110101001011 |
3 | 10222011111102212120111122 |
4 | 100110000310312311023 |
5 | 121331302040222311 |
6 | 2214551435145455 |
7 | 143663301335153 |
oct | 20240064666513 |
9 | 3864442776448 |
10 | 1121000320331 |
11 | 3a2460502531 |
12 | 1613108a528b |
13 | 8192c7a2b18 |
14 | 3c384581763 |
15 | 1e25e4630db |
hex | 10500d36d4b |
1121000320331 has 8 divisors (see below), whose sum is σ = 1129117972224. Its totient is φ = 1112891797800.
The previous prime is 1121000320327. The next prime is 1121000320339. The reversal of 1121000320331 is 1330230001211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1121000320331 - 22 = 1121000320327 is a prime.
It is a super-2 number, since 2×11210003203312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1121000320339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2035775 + ... + 2527128.
It is an arithmetic number, because the mean of its divisors is an integer number (141139746528).
Almost surely, 21121000320331 is an apocalyptic number.
1121000320331 is a deficient number, since it is larger than the sum of its proper divisors (8117651893).
1121000320331 is a wasteful number, since it uses less digits than its factorization.
1121000320331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4564681.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 1121000320331 its reverse (1330230001211), we get a palindrome (2451230321542).
The spelling of 1121000320331 in words is "one trillion, one hundred twenty-one billion, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •