Base | Representation |
---|---|
bin | 111000000010000111… |
… | …0111100010010110011 |
3 | 102111121000022221110121 |
4 | 1300010032330102303 |
5 | 3432414002011011 |
6 | 131140123511111 |
7 | 11456615026420 |
oct | 1600416742263 |
9 | 374530287417 |
10 | 120330110131 |
11 | 47039234810 |
12 | 1b3a2388497 |
13 | b4686c82ca |
14 | 5b77116d47 |
15 | 31e3e60e71 |
hex | 1c043bc4b3 |
120330110131 has 16 divisors (see below), whose sum is σ = 152261095680. Its totient is φ = 92364259680.
The previous prime is 120330110099. The next prime is 120330110249. The reversal of 120330110131 is 131011033021.
It is not a de Polignac number, because 120330110131 - 25 = 120330110099 is a prime.
It is a super-2 number, since 2×1203301101312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120330110731) 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 15 ways as a sum of consecutive naturals, for example, 11656996 + ... + 11667313.
It is an arithmetic number, because the mean of its divisors is an integer number (9516318480).
Almost surely, 2120330110131 is an apocalyptic number.
120330110131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120330110131 is a deficient number, since it is larger than the sum of its proper divisors (31930985549).
120330110131 is a wasteful number, since it uses less digits than its factorization.
120330110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23324394.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 120330110131 its reverse (131011033021), we get a palindrome (251341143152).
The spelling of 120330110131 in words is "one hundred twenty billion, three hundred thirty million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •