Base | Representation |
---|---|
bin | 11011100000111000001110… |
… | …000010010101100101000100 |
3 | 120212110010022002020021010111 |
4 | 123200320032002111211010 |
5 | 111330033101341404304 |
6 | 1105205403533202404 |
7 | 34326304305605404 |
oct | 3340701602254504 |
9 | 525403262207114 |
10 | 121006644091204 |
11 | 356136a1a53173 |
12 | 116a3a94330404 |
13 | 5269b54056911 |
14 | 21c4a77a68804 |
15 | dec9d9331704 |
hex | 6e0e0e095944 |
121006644091204 has 27 divisors (see below), whose sum is σ = 221369885663997. Its totient is φ = 57872500819584.
The previous prime is 121006644091147. The next prime is 121006644091231. The reversal of 121006644091204 is 402190446600121.
The square root of 121006644091204 is 11000302.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 120974261368900 + 32382722304 = 10998830^2 + 179952^2 .
It is a super-3 number, since 3×1210066440912043 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
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 8 ways as a sum of consecutive naturals, for example, 505894324 + ... + 506133460.
Almost surely, 2121006644091204 is an apocalyptic number.
121006644091204 is the 11000302-nd square number.
It is an amenable number.
121006644091204 is a deficient number, since it is larger than the sum of its proper divisors (100363241572793).
121006644091204 is an frugal number, since it uses more digits than its factorization.
121006644091204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478324 (or 239162 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 40.
The spelling of 121006644091204 in words is "one hundred twenty-one trillion, six billion, six hundred forty-four million, ninety-one thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •