Base | Representation |
---|---|
bin | 11011100001000101101011… |
… | …101011010000101110101011 |
3 | 120212111111121112120122001011 |
4 | 123201011223223100232223 |
5 | 111330302203100032334 |
6 | 1105220154213404351 |
7 | 34330325451042514 |
oct | 3341055353205653 |
9 | 525444545518034 |
10 | 121021100002219 |
11 | 3561983aa3506a |
12 | 116a68496396b7 |
13 | 526b318c51b11 |
14 | 21c56498dba0b |
15 | ded0834be564 |
hex | 6e116bad0bab |
121021100002219 has 2 divisors, whose sum is σ = 121021100002220. Its totient is φ = 121021100002218.
The previous prime is 121021100002069. The next prime is 121021100002241. The reversal of 121021100002219 is 912200001120121.
It is an a-pointer prime, because the next prime (121021100002241) can be obtained adding 121021100002219 to its sum of digits (22).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121021100002219 is a prime.
It is a super-2 number, since 2×1210211000022192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 121021100002219.
It is not a weakly prime, because it can be changed into another prime (121021100002249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60510550001109 + 60510550001110.
It is an arithmetic number, because the mean of its divisors is an integer number (60510550001110).
Almost surely, 2121021100002219 is an apocalyptic number.
121021100002219 is a deficient number, since it is larger than the sum of its proper divisors (1).
121021100002219 is an equidigital number, since it uses as much as digits as its factorization.
121021100002219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 121021100002219 in words is "one hundred twenty-one trillion, twenty-one billion, one hundred million, two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •