Base | Representation |
---|---|
bin | 11011100011101101001111… |
… | …101111101000000111111001 |
3 | 120220010201000110211001222010 |
4 | 123203231033233220013321 |
5 | 111341224142110323001 |
6 | 1105434551355520133 |
7 | 34346325155634210 |
oct | 3343551757500771 |
9 | 526121013731863 |
10 | 121201020011001 |
11 | 356890781016a7 |
12 | 117156a0459049 |
13 | 5282290139c88 |
14 | 21d0236c34077 |
15 | e02ab3b768d6 |
hex | 6e3b4fbe81f9 |
121201020011001 has 16 divisors (see below), whose sum is σ = 195551225564544. Its totient is φ = 65183741854464.
The previous prime is 121201020010997. The next prime is 121201020011021. The reversal of 121201020011001 is 100110020102121.
It is not a de Polignac number, because 121201020011001 - 22 = 121201020010997 is a prime.
It is a super-2 number, since 2×1212010200110012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (121201020011021) 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 15 ways as a sum of consecutive naturals, for example, 169749327390 + ... + 169749328103.
It is an arithmetic number, because the mean of its divisors is an integer number (12221951597784).
Almost surely, 2121201020011001 is an apocalyptic number.
It is an amenable number.
121201020011001 is a deficient number, since it is larger than the sum of its proper divisors (74350205553543).
121201020011001 is a wasteful number, since it uses less digits than its factorization.
121201020011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339498655520.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121201020011001 its reverse (100110020102121), we get a palindrome (221311040113122).
The spelling of 121201020011001 in words is "one hundred twenty-one trillion, two hundred one billion, twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •