Base | Representation |
---|---|
bin | 11011100011101101001110… |
… | …100111110111101001010011 |
3 | 120220010200222011102101102012 |
4 | 123203231032213313221103 |
5 | 111341224122301401321 |
6 | 1105434545444413135 |
7 | 34346324540020232 |
oct | 3343551647675123 |
9 | 526120864371365 |
10 | 121201001200211 |
11 | 35689068523899 |
12 | 117156960a71ab |
13 | 5282289281c2a |
14 | 21d0234538b19 |
15 | e02ab21ad05b |
hex | 6e3b4e9f7a53 |
121201001200211 has 8 divisors (see below), whose sum is σ = 127669031299920. Its totient is φ = 114741874104192.
The previous prime is 121201001200207. The next prime is 121201001200327. The reversal of 121201001200211 is 112002100102121.
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 121201001200211 - 22 = 121201001200207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121201001250211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2225722970 + ... + 2225777423.
It is an arithmetic number, because the mean of its divisors is an integer number (15958628912490).
Almost surely, 2121201001200211 is an apocalyptic number.
121201001200211 is a deficient number, since it is larger than the sum of its proper divisors (6468030099709).
121201001200211 is a wasteful number, since it uses less digits than its factorization.
121201001200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4451501845.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121201001200211 its reverse (112002100102121), we get a palindrome (233203101302332).
The spelling of 121201001200211 in words is "one hundred twenty-one trillion, two hundred one billion, one million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •