Base | Representation |
---|---|
bin | 11011100001000101101100… |
… | …011001000111010001100000 |
3 | 120212111111122101012022020101 |
4 | 123201011230121013101200 |
5 | 111330302214134201422 |
6 | 1105220155323152144 |
7 | 34330325655154111 |
oct | 3341055431072140 |
9 | 525444571168211 |
10 | 121021112022112 |
11 | 356198467a4865 |
12 | 116a6851675654 |
13 | 526b31b59cb93 |
14 | 21c564b34a208 |
15 | ded084595c27 |
hex | 6e116c647460 |
121021112022112 has 12 divisors (see below), whose sum is σ = 238260314293596. Its totient is φ = 60510556011040.
The previous prime is 121021112022043. The next prime is 121021112022163. The reversal of 121021112022112 is 211220211120121.
It is a happy number.
It is a super-3 number, since 3×1210211120221123 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 121021112022112.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1890954875314 + ... + 1890954875377.
It is an arithmetic number, because the mean of its divisors is an integer number (19855026191133).
Almost surely, 2121021112022112 is an apocalyptic number.
It is an amenable number.
121021112022112 is a deficient number, since it is larger than the sum of its proper divisors (117239202271484).
121021112022112 is an equidigital number, since it uses as much as digits as its factorization.
121021112022112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3781909750701 (or 3781909750693 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 121021112022112 its reverse (211220211120121), we get a palindrome (332241323142233).
The spelling of 121021112022112 in words is "one hundred twenty-one trillion, twenty-one billion, one hundred twelve million, twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •