Base | Representation |
---|---|
bin | 11011010101100110111000… |
… | …010010010001000100111011 |
3 | 120202201002002120011110001120 |
4 | 123111212320102101010323 |
5 | 111224340330444010321 |
6 | 1103413511443520323 |
7 | 34216324541613132 |
oct | 3325467022210473 |
9 | 522632076143046 |
10 | 120232111313211 |
11 | 35345174434297 |
12 | 115999569890a3 |
13 | 5211abb3602a1 |
14 | 219939db4c919 |
15 | dd77a6c52ec6 |
hex | 6d59b849113b |
120232111313211 has 8 divisors (see below), whose sum is σ = 160309549554000. Its totient is φ = 80154706973952.
The previous prime is 120232111313141. The next prime is 120232111313239. The reversal of 120232111313211 is 112313111232021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120232111313211 - 214 = 120232111296827 is a prime.
It is not an unprimeable number, because it can be changed into a prime (120232111311211) 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 7 ways as a sum of consecutive naturals, for example, 1465491 + ... + 15576003.
It is an arithmetic number, because the mean of its divisors is an integer number (20038693694250).
Almost surely, 2120232111313211 is an apocalyptic number.
120232111313211 is a deficient number, since it is larger than the sum of its proper divisors (40077438240789).
120232111313211 is a wasteful number, since it uses less digits than its factorization.
120232111313211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16950765.
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 120232111313211 its reverse (112313111232021), we get a palindrome (232545222545232).
The spelling of 120232111313211 in words is "one hundred twenty trillion, two hundred thirty-two billion, one hundred eleven million, three hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •