Base | Representation |
---|---|
bin | 11011100000011100101111… |
… | …100011000001010100010010 |
3 | 120212100022010222222011202101 |
4 | 123200130233203001110102 |
5 | 111324042141213123033 |
6 | 1105144044231111014 |
7 | 34324211226202105 |
oct | 3340345743012422 |
9 | 525308128864671 |
10 | 120977141536018 |
11 | 35602132590859 |
12 | 1169a21bb1246a |
13 | 5267131a60881 |
14 | 21c347970c73c |
15 | debd5e21897d |
hex | 6e072f8c1512 |
120977141536018 has 8 divisors (see below), whose sum is σ = 181492955337420. Its totient is φ = 60479489756880.
The previous prime is 120977141535967. The next prime is 120977141536019. The reversal of 120977141536018 is 810635141779021.
It can be written as a sum of positive squares in 2 ways, for example, as 89381084580649 + 31596056955369 = 9454157^2 + 5621037^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 120977141536018.
It is not an unprimeable number, because it can be changed into a prime (120977141536019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4540488913 + ... + 4540515556.
It is a 2-persistent number, because it is pandigital, and so is 2⋅120977141536018 = 241954283072036, but 3⋅120977141536018 = 362931424608054 is not.
Almost surely, 2120977141536018 is an apocalyptic number.
120977141536018 is a deficient number, since it is larger than the sum of its proper divisors (60515813801402).
120977141536018 is an equidigital number, since it uses as much as digits as its factorization.
120977141536018 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9081011132.
The product of its (nonzero) digits is 2540160, while the sum is 55.
The spelling of 120977141536018 in words is "one hundred twenty trillion, nine hundred seventy-seven billion, one hundred forty-one million, five hundred thirty-six thousand, eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •