Base | Representation |
---|---|
bin | 11011100000111101001110… |
… | …100101011100000110110101 |
3 | 120212110122011212201102222120 |
4 | 123200331032211130012311 |
5 | 111330130110113031401 |
6 | 1105212053324350153 |
7 | 34326554500235046 |
oct | 3340751645340665 |
9 | 525418155642876 |
10 | 121012022002101 |
11 | 35615a0170922a |
12 | 116a4b353a5359 |
13 | 526a500291809 |
14 | 21c5027dc08cd |
15 | decc01536836 |
hex | 6e0f4e95c1b5 |
121012022002101 has 8 divisors (see below), whose sum is σ = 166554180820224. Its totient is φ = 78072272259360.
The previous prime is 121012022002049. The next prime is 121012022002111. The reversal of 121012022002101 is 101200220210121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121012022002101 - 29 = 121012022001589 is a prime.
It is a super-3 number, since 3×1210120220021013 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121012022002111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 650602268736 + ... + 650602268921.
It is an arithmetic number, because the mean of its divisors is an integer number (20819272602528).
Almost surely, 2121012022002101 is an apocalyptic number.
It is an amenable number.
121012022002101 is a deficient number, since it is larger than the sum of its proper divisors (45542158818123).
121012022002101 is a wasteful number, since it uses less digits than its factorization.
121012022002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1301204537691.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121012022002101 its reverse (101200220210121), we get a palindrome (222212242212222).
The spelling of 121012022002101 in words is "one hundred twenty-one trillion, twelve billion, twenty-two million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •