Base | Representation |
---|---|
bin | 110111111011111101… |
… | …0001000111100000111 |
3 | 102111001121020102212202 |
4 | 1233313322020330013 |
5 | 3432003033032221 |
6 | 131103415505115 |
7 | 11451524313665 |
oct | 1576772107407 |
9 | 374047212782 |
10 | 120123330311 |
11 | 46a42540aa6 |
12 | 1b34508819b |
13 | b43490909a |
14 | 5b5788bc35 |
15 | 31d0c17d0b |
hex | 1bf7e88f07 |
120123330311 has 4 divisors (see below), whose sum is σ = 120132697824. Its totient is φ = 120113962800.
The previous prime is 120123330277. The next prime is 120123330323. The reversal of 120123330311 is 113033321021.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120123330311 is a prime.
It is a super-2 number, since 2×1201233303112 (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 (120123330391) 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 3 ways as a sum of consecutive naturals, for example, 4664495 + ... + 4690176.
It is an arithmetic number, because the mean of its divisors is an integer number (30033174456).
Almost surely, 2120123330311 is an apocalyptic number.
120123330311 is a deficient number, since it is larger than the sum of its proper divisors (9367513).
120123330311 is an equidigital number, since it uses as much as digits as its factorization.
120123330311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9367512.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 120123330311 its reverse (113033321021), we get a palindrome (233156651332).
The spelling of 120123330311 in words is "one hundred twenty billion, one hundred twenty-three million, three hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •