Base | Representation |
---|---|
bin | 11011100011111111111000… |
… | …011011101011111000100101 |
3 | 120220012121200000010221120202 |
4 | 123203333320123223320211 |
5 | 111342041132140032323 |
6 | 1105452101123240245 |
7 | 34350634062023051 |
oct | 3343777033537045 |
9 | 526177600127522 |
10 | 121221030002213 |
11 | 35696606235219 |
12 | 11719545819085 |
13 | 528412b90246b |
14 | 21d11b459ac61 |
15 | e03385717d28 |
hex | 6e3ff86ebe25 |
121221030002213 has 16 divisors (see below), whose sum is σ = 126504413016576. Its totient is φ = 116025049451520.
The previous prime is 121221030002207. The next prime is 121221030002221. The reversal of 121221030002213 is 312200030122121.
It is a cyclic number.
It is not a de Polignac number, because 121221030002213 - 214 = 121221029985829 is a prime.
It is a super-2 number, since 2×1212210300022132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121221030002243) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8655056 + ... + 17814377.
It is an arithmetic number, because the mean of its divisors is an integer number (7906525813536).
Almost surely, 2121221030002213 is an apocalyptic number.
It is an amenable number.
121221030002213 is a deficient number, since it is larger than the sum of its proper divisors (5283383014363).
121221030002213 is a wasteful number, since it uses less digits than its factorization.
121221030002213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26471084.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 121221030002213 its reverse (312200030122121), we get a palindrome (433421060124334).
The spelling of 121221030002213 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, thirty million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •