Base | Representation |
---|---|
bin | 11011100000110011111001… |
… | …010010101111000110011011 |
3 | 120212102200022111121221020011 |
4 | 123200303321102233012123 |
5 | 111324444044240214321 |
6 | 1105203315113542351 |
7 | 34326051250052416 |
oct | 3340637122570633 |
9 | 525380274557204 |
10 | 121002001101211 |
11 | 3561172a11905a |
12 | 116a2bb94149b7 |
13 | 5269594166b69 |
14 | 21c475717ab7d |
15 | dec8168eaae1 |
hex | 6e0cf94af19b |
121002001101211 has 4 divisors (see below), whose sum is σ = 121004273962000. Its totient is φ = 120999728240424.
The previous prime is 121002001101127. The next prime is 121002001101251. The reversal of 121002001101211 is 112101100200121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121002001101211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 121002001101191 and 121002001101200.
It is not an unprimeable number, because it can be changed into a prime (121002001101251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1136350536 + ... + 1136457013.
It is an arithmetic number, because the mean of its divisors is an integer number (30251068490500).
Almost surely, 2121002001101211 is an apocalyptic number.
121002001101211 is a deficient number, since it is larger than the sum of its proper divisors (2272860789).
121002001101211 is an equidigital number, since it uses as much as digits as its factorization.
121002001101211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2272860788.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 121002001101211 its reverse (112101100200121), we get a palindrome (233103101301332).
The spelling of 121002001101211 in words is "one hundred twenty-one trillion, two billion, one million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •