Base | Representation |
---|---|
bin | 110111111011111000… |
… | …1010101001010110111 |
3 | 102111001102220010020211 |
4 | 1233313301111022313 |
5 | 3432001440133421 |
6 | 131103254210251 |
7 | 11451465555430 |
oct | 1576761251267 |
9 | 374042803224 |
10 | 120121021111 |
11 | 46a41204073 |
12 | 1b344353987 |
13 | b4342aacb0 |
14 | 5b5744a487 |
15 | 31d090d9e1 |
hex | 1bf7c552b7 |
120121021111 has 16 divisors (see below), whose sum is σ = 147857297728. Its totient is φ = 95030496000.
The previous prime is 120121021081. The next prime is 120121021121. The reversal of 120121021111 is 111120121021.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 120121021111 - 211 = 120121019063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 120121021091 and 120121021100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120121021121) 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, 834331 + ... + 967651.
It is an arithmetic number, because the mean of its divisors is an integer number (9241081108).
Almost surely, 2120121021111 is an apocalyptic number.
120121021111 is a deficient number, since it is larger than the sum of its proper divisors (27736276617).
120121021111 is a wasteful number, since it uses less digits than its factorization.
120121021111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143242.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 120121021111 its reverse (111120121021), we get a palindrome (231241142132).
It can be divided in two parts, 120121021 and 111, that multiplied together give a palindrome (13333433331).
The spelling of 120121021111 in words is "one hundred twenty billion, one hundred twenty-one million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •