Base | Representation |
---|---|
bin | 11011100011101100100000… |
… | …001000011110110010100001 |
3 | 120220010121221210202021201021 |
4 | 123203230200020132302201 |
5 | 111341221023113020001 |
6 | 1105434340223005441 |
7 | 34346266316214400 |
oct | 3343544010366241 |
9 | 526117853667637 |
10 | 121200221220001 |
11 | 356887a8217150 |
12 | 117154b8a39881 |
13 | 52821937bb491 |
14 | 21d019cb01637 |
15 | e02a6898cba1 |
hex | 6e3b2021eca1 |
121200221220001 has 96 divisors (see below), whose sum is σ = 162592638405120. Its totient is φ = 89088612480000.
The previous prime is 121200221219989. The next prime is 121200221220083. The reversal of 121200221220001 is 100022122002121.
It is a happy number.
It is not a de Polignac number, because 121200221220001 - 25 = 121200221219969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (121200221220601) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 16253210865 + ... + 16253218321.
It is an arithmetic number, because the mean of its divisors is an integer number (1693673316720).
Almost surely, 2121200221220001 is an apocalyptic number.
121200221220001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121200221220001 is a deficient number, since it is larger than the sum of its proper divisors (41392417185119).
121200221220001 is a wasteful number, since it uses less digits than its factorization.
121200221220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14075 (or 14068 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 121200221220001 its reverse (100022122002121), we get a palindrome (221222343222122).
The spelling of 121200221220001 in words is "one hundred twenty-one trillion, two hundred billion, two hundred twenty-one million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •