Base | Representation |
---|---|
bin | 11011100010100001111000… |
… | …100110110111000001100101 |
3 | 120212211222011002210120012002 |
4 | 123202201320212313001211 |
5 | 111333412431401344343 |
6 | 1105333450100535045 |
7 | 34340432006246231 |
oct | 3342417046670145 |
9 | 525758132716162 |
10 | 121120101199973 |
11 | 35657823595267 |
12 | 11701a789b1485 |
13 | 52777658535c5 |
14 | 21ca35c0435c1 |
15 | e00929bb28b8 |
hex | 6e28789b7065 |
121120101199973 has 2 divisors, whose sum is σ = 121120101199974. Its totient is φ = 121120101199972.
The previous prime is 121120101199969. The next prime is 121120101199991. The reversal of 121120101199973 is 379991101021121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74171745739204 + 46948355460769 = 8612302^2 + 6851887^2 .
It is a cyclic number.
It is not a de Polignac number, because 121120101199973 - 22 = 121120101199969 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121120101199673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60560050599986 + 60560050599987.
It is an arithmetic number, because the mean of its divisors is an integer number (60560050599987).
Almost surely, 2121120101199973 is an apocalyptic number.
It is an amenable number.
121120101199973 is a deficient number, since it is larger than the sum of its proper divisors (1).
121120101199973 is an equidigital number, since it uses as much as digits as its factorization.
121120101199973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236, while the sum is 47.
The spelling of 121120101199973 in words is "one hundred twenty-one trillion, one hundred twenty billion, one hundred one million, one hundred ninety-nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •