Base | Representation |
---|---|
bin | 11011010101000100000100… |
… | …011101000110011100000000 |
3 | 120202120111121201010102020202 |
4 | 123111010010131012130000 |
5 | 111223232304014002333 |
6 | 1103344410533224332 |
7 | 34213532366231600 |
oct | 3325040435063400 |
9 | 522514551112222 |
10 | 120194734515968 |
11 | 35330334189312 |
12 | 115926654920a8 |
13 | 520b4128b5b08 |
14 | 2197655b02c00 |
15 | dd681a6d15e8 |
hex | 6d5104746700 |
120194734515968 has 108 divisors (see below), whose sum is σ = 288714377213640. Its totient is φ = 49735752062976.
The previous prime is 120194734515967. The next prime is 120194734515971. The reversal of 120194734515968 is 869515437491021.
It is a happy number.
120194734515968 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120194734515967) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 164840546 + ... + 165568097.
It is a 1-persistent number, because it is pandigital, but 2⋅120194734515968 = 240389469031936 is not.
Almost surely, 2120194734515968 is an apocalyptic number.
It is an amenable number.
120194734515968 is an abundant number, since it is smaller than the sum of its proper divisors (168519642697672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120194734515968 is an equidigital number, since it uses as much as digits as its factorization.
120194734515968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 330408702 (or 330408681 counting only the distinct ones).
The product of its (nonzero) digits is 65318400, while the sum is 65.
The spelling of 120194734515968 in words is "one hundred twenty trillion, one hundred ninety-four billion, seven hundred thirty-four million, five hundred fifteen thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •