Base | Representation |
---|---|
bin | 10000010100001100110… |
… | …011001100011100111011 |
3 | 10222012000102212212222000 |
4 | 100110030303030130323 |
5 | 121332210002224240 |
6 | 2215023413032043 |
7 | 144001261022622 |
oct | 20241463143473 |
9 | 3865012785860 |
10 | 1121201211195 |
11 | 3a255394383a |
12 | 161368025623 |
13 | 819622ac760 |
14 | 3c3a31166b9 |
15 | 1e271de6430 |
hex | 1050cccc73b |
1121201211195 has 64 divisors (see below), whose sum is σ = 2146805552640. Its totient is φ = 551916249984.
The previous prime is 1121201211161. The next prime is 1121201211241. The reversal of 1121201211195 is 5911121021211.
It is not a de Polignac number, because 1121201211195 - 26 = 1121201211131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 in 63 ways as a sum of consecutive naturals, for example, 19253112 + ... + 19311258.
It is an arithmetic number, because the mean of its divisors is an integer number (33543836760).
Almost surely, 21121201211195 is an apocalyptic number.
1121201211195 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1121201211195 is a deficient number, since it is larger than the sum of its proper divisors (1025604341445).
1121201211195 is a wasteful number, since it uses less digits than its factorization.
1121201211195 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69161 (or 69155 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 27.
The spelling of 1121201211195 in words is "one trillion, one hundred twenty-one billion, two hundred one million, two hundred eleven thousand, one hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •