Base | Representation |
---|---|
bin | 110111111100110011… |
… | …1110000000001111111 |
3 | 102111010121022021021011 |
4 | 1233321213300001333 |
5 | 3432032412023002 |
6 | 131110323420051 |
7 | 11452323460024 |
oct | 1577147600177 |
9 | 374117267234 |
10 | 120152064127 |
11 | 46a57787157 |
12 | 1b352824627 |
13 | b43a859944 |
14 | 5b5b60b54b |
15 | 31d34e18d7 |
hex | 1bf99f007f |
120152064127 has 4 divisors (see below), whose sum is σ = 120239069176. Its totient is φ = 120065059080.
The previous prime is 120152064113. The next prime is 120152064133. The reversal of 120152064127 is 721460251021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 721460251021 = 19 ⋅37971592159.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120152064127 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 (120152064427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43500453 + ... + 43503214.
It is an arithmetic number, because the mean of its divisors is an integer number (30059767294).
Almost surely, 2120152064127 is an apocalyptic number.
120152064127 is a deficient number, since it is larger than the sum of its proper divisors (87005049).
120152064127 is an equidigital number, since it uses as much as digits as its factorization.
120152064127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87005048.
The product of its (nonzero) digits is 6720, while the sum is 31.
The spelling of 120152064127 in words is "one hundred twenty billion, one hundred fifty-two million, sixty-four thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •