Base | Representation |
---|---|
bin | 110111111011101001… |
… | …1010100000101000001 |
3 | 102111000220002100022011 |
4 | 1233313103110011001 |
5 | 3431442431333241 |
6 | 131102413412521 |
7 | 11451341643361 |
oct | 1576723240501 |
9 | 374026070264 |
10 | 120113152321 |
11 | 46a3781a138 |
12 | 1b34179a141 |
13 | b4327844c6 |
14 | 5b5639c9a1 |
15 | 31ceda7281 |
hex | 1bf74d4141 |
120113152321 has 8 divisors (see below), whose sum is σ = 129518676000. Its totient is φ = 111016006560.
The previous prime is 120113152303. The next prime is 120113152351. The reversal of 120113152321 is 123251311021.
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 120113152321 - 211 = 120113150273 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120113152292 and 120113152301.
It is not an unprimeable number, because it can be changed into a prime (120113152351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 77093671 + ... + 77095228.
It is an arithmetic number, because the mean of its divisors is an integer number (16189834500).
Almost surely, 2120113152321 is an apocalyptic number.
It is an amenable number.
120113152321 is a deficient number, since it is larger than the sum of its proper divisors (9405523679).
120113152321 is a wasteful number, since it uses less digits than its factorization.
120113152321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154188959.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 120113152321 its reverse (123251311021), we get a palindrome (243364463342).
The spelling of 120113152321 in words is "one hundred twenty billion, one hundred thirteen million, one hundred fifty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •