Base | Representation |
---|---|
bin | 111000000010001011… |
… | …1000010011001110111 |
3 | 102111121011022202112212 |
4 | 1300010113002121313 |
5 | 3432420022413221 |
6 | 131140241204035 |
7 | 11456642045504 |
oct | 1600427023167 |
9 | 374534282485 |
10 | 120332232311 |
11 | 4703a454185 |
12 | 1b3a303061b |
13 | b468c8c235 |
14 | 5b7750a4ab |
15 | 31e422eb5b |
hex | 1c045c2677 |
120332232311 has 4 divisors (see below), whose sum is σ = 120589903512. Its totient is φ = 120074561112.
The previous prime is 120332232287. The next prime is 120332232313. The reversal of 120332232311 is 113232233021.
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 120332232311 - 26 = 120332232247 is a prime.
It is a super-2 number, since 2×1203322323112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120332232313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128834900 + ... + 128835833.
It is an arithmetic number, because the mean of its divisors is an integer number (30147475878).
Almost surely, 2120332232311 is an apocalyptic number.
120332232311 is a deficient number, since it is larger than the sum of its proper divisors (257671201).
120332232311 is an equidigital number, since it uses as much as digits as its factorization.
120332232311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257671200.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 120332232311 its reverse (113232233021), we get a palindrome (233564465332).
The spelling of 120332232311 in words is "one hundred twenty billion, three hundred thirty-two million, two hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •