Base | Representation |
---|---|
bin | 111000011001011000… |
… | …1111010100101010101 |
3 | 102120121102202210021110 |
4 | 1300302301322211111 |
5 | 3441013410430401 |
6 | 131345421405233 |
7 | 11515146525135 |
oct | 1606261724525 |
9 | 376542683243 |
10 | 121111030101 |
11 | 473aa023516 |
12 | 1b57ba09819 |
13 | b56142a729 |
14 | 5c0cb16ac5 |
15 | 323c7b99d6 |
hex | 1c32c7a955 |
121111030101 has 8 divisors (see below), whose sum is σ = 161896494240. Its totient is φ = 80533126352.
The previous prime is 121111030039. The next prime is 121111030127. The reversal of 121111030101 is 101030111121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121111030101 - 217 = 121110899029 is a prime.
It is a super-2 number, since 2×1211110301012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121111040101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51888735 + ... + 51891068.
It is an arithmetic number, because the mean of its divisors is an integer number (20237061780).
Almost surely, 2121111030101 is an apocalyptic number.
It is an amenable number.
121111030101 is a deficient number, since it is larger than the sum of its proper divisors (40785464139).
121111030101 is a wasteful number, since it uses less digits than its factorization.
121111030101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103780195.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 121111030101 its reverse (101030111121), we get a palindrome (222141141222).
The spelling of 121111030101 in words is "one hundred twenty-one billion, one hundred eleven million, thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •