Base | Representation |
---|---|
bin | 10000010100000010000… |
… | …100001000011110011111 |
3 | 10222011112212222101120110 |
4 | 100110002010020132133 |
5 | 121331322400230413 |
6 | 2214553500421103 |
7 | 143663643101106 |
oct | 20240204103637 |
9 | 3864485871513 |
10 | 1121021101983 |
11 | 3a2471207052 |
12 | 161317847793 |
13 | 81933b9ac63 |
14 | 3c38723103d |
15 | 1e2611ba8c3 |
hex | 1050210879f |
1121021101983 has 16 divisors (see below), whose sum is σ = 1498665168000. Its totient is φ = 745364585760.
The previous prime is 1121021101979. The next prime is 1121021101987. The reversal of 1121021101983 is 3891011201211.
It is an interprime number because it is at equal distance from previous prime (1121021101979) and next prime (1121021101987).
It is not a de Polignac number, because 1121021101983 - 22 = 1121021101979 is a prime.
It is a super-2 number, since 2×11210211019832 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1121021101983.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121021101987) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1604668 + ... + 2194766.
It is an arithmetic number, because the mean of its divisors is an integer number (93666573000).
Almost surely, 21121021101983 is an apocalyptic number.
1121021101983 is a deficient number, since it is larger than the sum of its proper divisors (377644066017).
1121021101983 is a wasteful number, since it uses less digits than its factorization.
1121021101983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591782.
The product of its (nonzero) digits is 864, while the sum is 30.
The spelling of 1121021101983 in words is "one trillion, one hundred twenty-one billion, twenty-one million, one hundred one thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •