Base | Representation |
---|---|
bin | 11011100000110010111110… |
… | …110100001101110111000001 |
3 | 120212102120210010112221211211 |
4 | 123200302332310031313001 |
5 | 111324440042111202314 |
6 | 1105203033510010121 |
7 | 34326015035034655 |
oct | 3340627664156701 |
9 | 525376703487754 |
10 | 121001020022209 |
11 | 35611276348968 |
12 | 116a2984946941 |
13 | 5269468b22c42 |
14 | 21c46a2b56a65 |
15 | dec7aa7059c4 |
hex | 6e0cbed0ddc1 |
121001020022209 has 8 divisors (see below), whose sum is σ = 127930593860640. Its totient is φ = 114127556093856.
The previous prime is 121001020022177. The next prime is 121001020022237. The reversal of 121001020022209 is 902220020100121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121001020022209 - 25 = 121001020022177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 121001020022209.
It is not an unprimeable number, because it can be changed into a prime (121001020022609) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14027473084 + ... + 14027481709.
It is an arithmetic number, because the mean of its divisors is an integer number (15991324232580).
Almost surely, 2121001020022209 is an apocalyptic number.
121001020022209 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
121001020022209 is a deficient number, since it is larger than the sum of its proper divisors (6929573838431).
121001020022209 is a wasteful number, since it uses less digits than its factorization.
121001020022209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28054955039.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 121001020022209 in words is "one hundred twenty-one trillion, one billion, twenty million, twenty-two thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •