Base | Representation |
---|---|
bin | 11011010010011010001011… |
… | …001111100100101010110011 |
3 | 120201221001202101112200122101 |
4 | 123102122023033210222303 |
5 | 111212240203422101321 |
6 | 1103124521204121231 |
7 | 34164413656050142 |
oct | 3322321317445263 |
9 | 521831671480571 |
10 | 120012312300211 |
11 | 3526aa32640631 |
12 | 11563234696217 |
13 | 51c71601a7b06 |
14 | 218c8ac343759 |
15 | dd1be0514791 |
hex | 6d268b3e4ab3 |
120012312300211 has 8 divisors (see below), whose sum is σ = 124175208603600. Its totient is φ = 115851052044000.
The previous prime is 120012312300169. The next prime is 120012312300263. The reversal of 120012312300211 is 112003213210021.
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 120012312300211 - 227 = 120012178082483 is a prime.
It is a super-3 number, since 3×1200123123002113 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120012312390211) 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, 408862540 + ... + 409155961.
It is an arithmetic number, because the mean of its divisors is an integer number (15521901075450).
Almost surely, 2120012312300211 is an apocalyptic number.
120012312300211 is a deficient number, since it is larger than the sum of its proper divisors (4162896303389).
120012312300211 is an equidigital number, since it uses as much as digits as its factorization.
120012312300211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 818023589.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 120012312300211 its reverse (112003213210021), we get a palindrome (232015525510232).
The spelling of 120012312300211 in words is "one hundred twenty trillion, twelve billion, three hundred twelve million, three hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •