Base | Representation |
---|---|
bin | 11011100100000000000011… |
… | …010010011010010010001001 |
3 | 120220012122010200211111111102 |
4 | 123210000003102122102021 |
5 | 111342042020300321301 |
6 | 1105452131150511145 |
7 | 34350641433012224 |
oct | 3344000322322211 |
9 | 526178120744442 |
10 | 121221212120201 |
11 | 3569669a014156 |
12 | 117195968054b5 |
13 | 528415a56839b |
14 | 21d11d08465bb |
15 | e033966ddb6b |
hex | 6e400349a489 |
121221212120201 has 64 divisors (see below), whose sum is σ = 131002415824896. Its totient is φ = 111886817011200.
The previous prime is 121221212120159. The next prime is 121221212120263. The reversal of 121221212120201 is 102021212122121.
It is a cyclic number.
It is not a de Polignac number, because 121221212120201 - 26 = 121221212120137 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (121223212120201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 25322999930 + ... + 25323004716.
It is an arithmetic number, because the mean of its divisors is an integer number (2046912747264).
Almost surely, 2121221212120201 is an apocalyptic number.
It is an amenable number.
121221212120201 is a deficient number, since it is larger than the sum of its proper divisors (9781203704695).
121221212120201 is a wasteful number, since it uses less digits than its factorization.
121221212120201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5822.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 121221212120201 its reverse (102021212122121), we get a palindrome (223242424242322).
The spelling of 121221212120201 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, two hundred twelve million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •