Base | Representation |
---|---|
bin | 11011010011110101010111… |
… | …001000001100110110010011 |
3 | 120202021102110220021221200222 |
4 | 123103311113020030312103 |
5 | 111220341213340401321 |
6 | 1103241512505103255 |
7 | 34204451163343505 |
oct | 3323652710146623 |
9 | 522242426257628 |
10 | 120110222200211 |
11 | 352a850618a661 |
12 | 1157a1ba487b2b |
13 | 5203464984899 |
14 | 2193519973d75 |
15 | dd4520ee03ab |
hex | 6d3d5720cd93 |
120110222200211 has 8 divisors (see below), whose sum is σ = 123985835372544. Its totient is φ = 116234677145160.
The previous prime is 120110222200207. The next prime is 120110222200217. The reversal of 120110222200211 is 112002222011021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120110222200211 - 22 = 120110222200207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120110222200211.
It is not an unprimeable number, because it can be changed into a prime (120110222200217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13433801 + ... + 20510666.
It is an arithmetic number, because the mean of its divisors is an integer number (15498229421568).
Almost surely, 2120110222200211 is an apocalyptic number.
120110222200211 is a deficient number, since it is larger than the sum of its proper divisors (3875613172333).
120110222200211 is a wasteful number, since it uses less digits than its factorization.
120110222200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34058641.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 120110222200211 its reverse (112002222011021), we get a palindrome (232112444211232).
The spelling of 120110222200211 in words is "one hundred twenty trillion, one hundred ten billion, two hundred twenty-two million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •