Base | Representation |
---|---|
bin | 11011010011110101010111… |
… | …001000001111011111000011 |
3 | 120202021102110220022111111222 |
4 | 123103311113020033133003 |
5 | 111220341213341223021 |
6 | 1103241512505225255 |
7 | 34204451163420134 |
oct | 3323652710173703 |
9 | 522242426274458 |
10 | 120110222211011 |
11 | 352a850619778a |
12 | 1157a1ba49222b |
13 | 5203464989786 |
14 | 2193519977c8b |
15 | dd4520ee36ab |
hex | 6d3d5720f7c3 |
120110222211011 has 8 divisors (see below), whose sum is σ = 127312424496720. Its totient is φ = 112923230491648.
The previous prime is 120110222210987. The next prime is 120110222211013. The reversal of 120110222211011 is 110112222011021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120110222211011 - 234 = 120093042341827 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120110222211013) 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, 3802625321 + ... + 3802656906.
It is an arithmetic number, because the mean of its divisors is an integer number (15914053062090).
Almost surely, 2120110222211011 is an apocalyptic number.
120110222211011 is a deficient number, since it is larger than the sum of its proper divisors (7202202285709).
120110222211011 is an equidigital number, since it uses as much as digits as its factorization.
120110222211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7605283173.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 120110222211011 its reverse (110112222011021), we get a palindrome (230222444222032).
The spelling of 120110222211011 in words is "one hundred twenty trillion, one hundred ten billion, two hundred twenty-two million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •