Base | Representation |
---|---|
bin | 11011100001000101100110… |
… | …010111101111111100010101 |
3 | 120212111111101100002220110202 |
4 | 123201011212113233330111 |
5 | 111330302012304013414 |
6 | 1105220141314030245 |
7 | 34330323320410202 |
oct | 3341054627577425 |
9 | 525444340086422 |
10 | 121021011001109 |
11 | 356197a477622a |
12 | 116a6823878385 |
13 | 526b30368c73b |
14 | 21c563bb70ca9 |
15 | ded07a78d9de |
hex | 6e11665eff15 |
121021011001109 has 8 divisors (see below), whose sum is σ = 121054943522520. Its totient is φ = 120987079888896.
The previous prime is 121021011001103. The next prime is 121021011001249. The reversal of 121021011001109 is 901100110120121.
It can be written as a sum of positive squares in 4 ways, for example, as 16280175916900 + 104740835084209 = 4034870^2 + 10234297^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121021011001109 - 28 = 121021011000853 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121021011001103) 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, 185029037 + ... + 185681949.
It is an arithmetic number, because the mean of its divisors is an integer number (15131867940315).
Almost surely, 2121021011001109 is an apocalyptic number.
It is an amenable number.
121021011001109 is a deficient number, since it is larger than the sum of its proper divisors (33932521411).
121021011001109 is an equidigital number, since it uses as much as digits as its factorization.
121021011001109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704599.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 121021011001109 in words is "one hundred twenty-one trillion, twenty-one billion, eleven million, one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •