Base | Representation |
---|---|
bin | 111000011001010111… |
… | …0011001111110010101 |
3 | 102120121101001001021101 |
4 | 1300302232121332111 |
5 | 3441013142010401 |
6 | 131345345550101 |
7 | 11515135644001 |
oct | 1606256317625 |
9 | 376541031241 |
10 | 121110110101 |
11 | 473a9555292 |
12 | 1b57b645331 |
13 | b561197a56 |
14 | 5c0c957701 |
15 | 323c687101 |
hex | 1c32b99f95 |
121110110101 has 16 divisors (see below), whose sum is σ = 126660183408. Its totient is φ = 115719552000.
The previous prime is 121110110089. The next prime is 121110110113. The reversal of 121110110101 is 101011011121.
It is an interprime number because it is at equal distance from previous prime (121110110089) and next prime (121110110113).
It can be written as a sum of positive squares in 8 ways, for example, as 26977734001 + 94132376100 = 164249^2 + 306810^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121110110101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121110110131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 141085 + ... + 511981.
It is an arithmetic number, because the mean of its divisors is an integer number (7916261463).
Almost surely, 2121110110101 is an apocalyptic number.
It is an amenable number.
121110110101 is a deficient number, since it is larger than the sum of its proper divisors (5550073307).
121110110101 is a wasteful number, since it uses less digits than its factorization.
121110110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 371112.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 121110110101 its reverse (101011011121), we get a palindrome (222121121222).
The spelling of 121110110101 in words is "one hundred twenty-one billion, one hundred ten million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •