Base | Representation |
---|---|
bin | 11011100011111111110111… |
… | …111001110000111101010111 |
3 | 120220012121122101102011220100 |
4 | 123203333313321300331113 |
5 | 111342041122401010403 |
6 | 1105452100204505143 |
7 | 34350633623316405 |
oct | 3343776771607527 |
9 | 526177571364810 |
10 | 121221021110103 |
11 | 35696601211472 |
12 | 1171954284b1b3 |
13 | 5284129b0ac65 |
14 | 21d11b3324475 |
15 | e03384a5d2a3 |
hex | 6e3ff7e70f57 |
121221021110103 has 48 divisors (see below), whose sum is σ = 186539578767360. Its totient is φ = 75638893176000.
The previous prime is 121221021110069. The next prime is 121221021110117. The reversal of 121221021110103 is 301011120122121.
It is a happy number.
121221021110103 is a `hidden beast` number, since 121 + 221 + 0 + 211 + 10 + 103 = 666.
It is not a de Polignac number, because 121221021110103 - 210 = 121221021109079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121221021100103) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 416818 + ... + 15576128.
It is an arithmetic number, because the mean of its divisors is an integer number (3886241224320).
Almost surely, 2121221021110103 is an apocalyptic number.
121221021110103 is a deficient number, since it is larger than the sum of its proper divisors (65318557657257).
121221021110103 is a wasteful number, since it uses less digits than its factorization.
121221021110103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15159900 (or 15159897 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 121221021110103 its reverse (301011120122121), we get a palindrome (422232141232224).
The spelling of 121221021110103 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, twenty-one million, one hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •