Base | Representation |
---|---|
bin | 11011100010011001011010… |
… | …001100110100010100110110 |
3 | 120212211002122220101201010221 |
4 | 123202121122030310110312 |
5 | 111333240312241401402 |
6 | 1105325343102404554 |
7 | 34336660340000035 |
oct | 3342313214642466 |
9 | 525732586351127 |
10 | 121111001122102 |
11 | 3565398385a052 |
12 | 1170015929075a |
13 | 5276945433244 |
14 | 21c9b3761a71c |
15 | e00595d18337 |
hex | 6e265a334536 |
121111001122102 has 8 divisors (see below), whose sum is σ = 184745594932200. Its totient is φ = 59529136144704.
The previous prime is 121111001122061. The next prime is 121111001122109. The reversal of 121111001122102 is 201221100111121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1211110011221022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121111001122109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 513182208027 + ... + 513182208262.
It is an arithmetic number, because the mean of its divisors is an integer number (23093199366525).
Almost surely, 2121111001122102 is an apocalyptic number.
121111001122102 is a deficient number, since it is larger than the sum of its proper divisors (63634593810098).
121111001122102 is a wasteful number, since it uses less digits than its factorization.
121111001122102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1026364416350.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 121111001122102 its reverse (201221100111121), we get a palindrome (322332101233223).
The spelling of 121111001122102 in words is "one hundred twenty-one trillion, one hundred eleven billion, one million, one hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •