Base | Representation |
---|---|
bin | 11011100001000101100101… |
… | …101101110010101001000000 |
3 | 120212111111100120102002200111 |
4 | 123201011211231302221000 |
5 | 111330302002000031422 |
6 | 1105220140242201104 |
7 | 34330323125050150 |
oct | 3341054555625100 |
9 | 525444316362614 |
10 | 121021000002112 |
11 | 35619799543551 |
12 | 116a6820053194 |
13 | 526b30130b262 |
14 | 21c563a50a760 |
15 | ded079819a77 |
hex | 6e1165b72a40 |
121021000002112 has 56 divisors (see below), whose sum is σ = 274485196820736. Its totient is φ = 51861067419648.
The previous prime is 121021000002109. The next prime is 121021000002113. The reversal of 121021000002112 is 211200000120121.
It is a tau number, because it is divible by the number of its divisors (56).
It is a super-2 number, since 2×1210210000021122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 121021000002092 and 121021000002101.
It is not an unprimeable number, because it can be changed into a prime (121021000002113) 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, 8632273 + ... + 17792080.
Almost surely, 2121021000002112 is an apocalyptic number.
It is an amenable number.
121021000002112 is an abundant number, since it is smaller than the sum of its proper divisors (153464196818624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121021000002112 is a wasteful number, since it uses less digits than its factorization.
121021000002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26434595 (or 26434585 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121021000002112 its reverse (211200000120121), we get a palindrome (332221000122233).
The spelling of 121021000002112 in words is "one hundred twenty-one trillion, twenty-one billion, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •