Base | Representation |
---|---|
bin | 11011011011111111101110… |
… | …101101101000101010100100 |
3 | 120211021001020012202100120002 |
4 | 123123333232231220222210 |
5 | 111304033413421342242 |
6 | 1104351313153200432 |
7 | 34263125424455264 |
oct | 3333775655505244 |
9 | 524231205670502 |
10 | 120671111121572 |
11 | 354a437037a970 |
12 | 1164aa52b60118 |
13 | 52443107776bb |
14 | 21b27277217a4 |
15 | de3dec415432 |
hex | 6dbfeeb68aa4 |
120671111121572 has 192 divisors, whose sum is σ = 248256625655808. Its totient is φ = 50772273552000.
The previous prime is 120671111121571. The next prime is 120671111121637. The reversal of 120671111121572 is 275121111176021.
It is not an unprimeable number, because it can be changed into a prime (120671111121571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3597059303 + ... + 3597092849.
It is an arithmetic number, because the mean of its divisors is an integer number (1293003258624).
Almost surely, 2120671111121572 is an apocalyptic number.
It is an amenable number.
120671111121572 is an abundant number, since it is smaller than the sum of its proper divisors (127585514534236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120671111121572 is a wasteful number, since it uses less digits than its factorization.
120671111121572 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34390 (or 34388 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 38.
Adding to 120671111121572 its reverse (275121111176021), we get a palindrome (395792222297593).
The spelling of 120671111121572 in words is "one hundred twenty trillion, six hundred seventy-one billion, one hundred eleven million, one hundred twenty-one thousand, five hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •