Base | Representation |
---|---|
bin | 10000010100010011011… |
… | …010100111110000110101 |
3 | 10222012022011202012122212 |
4 | 100110103122213300311 |
5 | 121332421411204343 |
6 | 2215042420103205 |
7 | 144004106344334 |
oct | 20242332476065 |
9 | 3865264665585 |
10 | 1121312209973 |
11 | 3a260056786a |
12 | 161399234b05 |
13 | 8197c2a45c7 |
14 | 3c3b3b6bd1b |
15 | 1e27ba1ec18 |
hex | 105136a7c35 |
1121312209973 has 2 divisors, whose sum is σ = 1121312209974. Its totient is φ = 1121312209972.
The previous prime is 1121312209951. The next prime is 1121312210017. The reversal of 1121312209973 is 3799022131211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1109552542609 + 11759667364 = 1053353^2 + 108442^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121312209973 - 218 = 1121311947829 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1121312209973.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121312209933) by changing a digit.
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 as a sum of consecutive naturals, namely, 560656104986 + 560656104987.
It is an arithmetic number, because the mean of its divisors is an integer number (560656104987).
Almost surely, 21121312209973 is an apocalyptic number.
It is an amenable number.
1121312209973 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121312209973 is an equidigital number, since it uses as much as digits as its factorization.
1121312209973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 41.
The spelling of 1121312209973 in words is "one trillion, one hundred twenty-one billion, three hundred twelve million, two hundred nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •