Base | Representation |
---|---|
bin | 111000000010000111… |
… | …0100100100110110111 |
3 | 102111121000011000101021 |
4 | 1300010032210212313 |
5 | 3432413440404421 |
6 | 131140121442011 |
7 | 11456614143520 |
oct | 1600416444667 |
9 | 374530130337 |
10 | 120330013111 |
11 | 47039178930 |
12 | 1b3a2340307 |
13 | b4686930b9 |
14 | 5b770cd847 |
15 | 31e3e42341 |
hex | 1c043a49b7 |
120330013111 has 8 divisors (see below), whose sum is σ = 150021834624. Its totient is φ = 93763646520.
The previous prime is 120330013093. The next prime is 120330013147. The reversal of 120330013111 is 111310033021.
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 120330013111 - 217 = 120329882039 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120330013151) 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 7 ways as a sum of consecutive naturals, for example, 781363645 + ... + 781363798.
It is an arithmetic number, because the mean of its divisors is an integer number (18752729328).
Almost surely, 2120330013111 is an apocalyptic number.
120330013111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
120330013111 is a deficient number, since it is larger than the sum of its proper divisors (29691821513).
120330013111 is a wasteful number, since it uses less digits than its factorization.
120330013111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1562727461.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 120330013111 its reverse (111310033021), we get a palindrome (231640046132).
The spelling of 120330013111 in words is "one hundred twenty billion, three hundred thirty million, thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •