Base | Representation |
---|---|
bin | 10110110000111101001001… |
… | …111000101000100110111101 |
3 | 111010111111101010022100201202 |
4 | 112300331021320220212331 |
5 | 101110341230342021341 |
6 | 552535015435345245 |
7 | 30042343136050016 |
oct | 2660751170504675 |
9 | 433444333270652 |
10 | 100121222220221 |
11 | 299a1198874454 |
12 | b2901b68b2225 |
13 | 43b3510604637 |
14 | 1aa1c705d000d |
15 | b895b1bee79b |
hex | 5b0f49e289bd |
100121222220221 has 16 divisors (see below), whose sum is σ = 108322849476864. Its totient is φ = 92178595981824.
The previous prime is 100121222220163. The next prime is 100121222220259. The reversal of 100121222220221 is 122022222121001.
It is not a de Polignac number, because 100121222220221 - 26 = 100121222220157 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100121222220193 and 100121222220202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100121222220421) 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, 31223255 + ... + 34280228.
It is an arithmetic number, because the mean of its divisors is an integer number (6770178092304).
Almost surely, 2100121222220221 is an apocalyptic number.
It is an amenable number.
100121222220221 is a deficient number, since it is larger than the sum of its proper divisors (8201627256643).
100121222220221 is a wasteful number, since it uses less digits than its factorization.
100121222220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65505460.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 100121222220221 its reverse (122022222121001), we get a palindrome (222143444341222).
The spelling of 100121222220221 in words is "one hundred trillion, one hundred twenty-one billion, two hundred twenty-two million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •