Base | Representation |
---|---|
bin | 111000010110101011… |
… | …0101100111001111111 |
3 | 102120101002111111022201 |
4 | 1300231112230321333 |
5 | 3440322110310421 |
6 | 131332410452331 |
7 | 11512663053550 |
oct | 1605526547177 |
9 | 376332444281 |
10 | 121020010111 |
11 | 47362705890 |
12 | 1b5554340a7 |
13 | b54860c450 |
14 | 5c009c2327 |
15 | 32347dab91 |
hex | 1c2d5ace7f |
121020010111 has 16 divisors (see below), whose sum is σ = 162488406528. Its totient is φ = 87047359200.
The previous prime is 121020010103. The next prime is 121020010121. The reversal of 121020010111 is 111010020121.
It is a cyclic number.
It is not a de Polignac number, because 121020010111 - 23 = 121020010103 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121020010121) 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 15 ways as a sum of consecutive naturals, for example, 60448555 + ... + 60450556.
It is an arithmetic number, because the mean of its divisors is an integer number (10155525408).
Almost surely, 2121020010111 is an apocalyptic number.
121020010111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
121020010111 is a deficient number, since it is larger than the sum of its proper divisors (41468396417).
121020010111 is a wasteful number, since it uses less digits than its factorization.
121020010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120899142.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 121020010111 its reverse (111010020121), we get a palindrome (232030030232).
It can be divided in two parts, 121020010 and 111, that added together give a palindrome (121020121).
The spelling of 121020010111 in words is "one hundred twenty-one billion, twenty million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •