Base | Representation |
---|---|
bin | 11110110110100000011… |
… | …010100101100101111011 |
3 | 21111200101010101021002212 |
4 | 132312200122211211323 |
5 | 234213441202414321 |
6 | 4301544251245335 |
7 | 306113210240552 |
oct | 36664032454573 |
9 | 7450333337085 |
10 | 2120110201211 |
11 | 748151a34792 |
12 | 2a2a8474984b |
13 | 124c05524552 |
14 | 748846c0d99 |
15 | 3a2379a055b |
hex | 1eda06a597b |
2120110201211 has 4 divisors (see below), whose sum is σ = 2141101391424. Its totient is φ = 2099119011000.
The previous prime is 2120110201207. The next prime is 2120110201217. The reversal of 2120110201211 is 1121020110212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2120110201211 - 22 = 2120110201207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2120110201217) 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, 10495594955 + ... + 10495595156.
It is an arithmetic number, because the mean of its divisors is an integer number (535275347856).
Almost surely, 22120110201211 is an apocalyptic number.
2120110201211 is a deficient number, since it is larger than the sum of its proper divisors (20991190213).
2120110201211 is a wasteful number, since it uses less digits than its factorization.
2120110201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20991190212.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2120110201211 its reverse (1121020110212), we get a palindrome (3241130311423).
Subtracting from 2120110201211 its reverse (1121020110212), we obtain a palindrome (999090090999).
The spelling of 2120110201211 in words is "two trillion, one hundred twenty billion, one hundred ten million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •