Base | Representation |
---|---|
bin | 111000001011100111… |
… | …0011000011000111011 |
3 | 102112102012212111222211 |
4 | 1300113032120120323 |
5 | 3434042033331141 |
6 | 131231504555551 |
7 | 11500534200004 |
oct | 1602716303073 |
9 | 375365774884 |
10 | 120648730171 |
11 | 47192076762 |
12 | 1b471022bb7 |
13 | b4b9715388 |
14 | 5ba75761ab |
15 | 3211debd81 |
hex | 1c1739863b |
120648730171 has 2 divisors, whose sum is σ = 120648730172. Its totient is φ = 120648730170.
The previous prime is 120648730099. The next prime is 120648730199. The reversal of 120648730171 is 171037846021.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120648730171 - 29 = 120648729659 is a prime.
It is a super-2 number, since 2×1206487301712 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (120648730871) 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 as a sum of consecutive naturals, namely, 60324365085 + 60324365086.
It is an arithmetic number, because the mean of its divisors is an integer number (60324365086).
Almost surely, 2120648730171 is an apocalyptic number.
120648730171 is a deficient number, since it is larger than the sum of its proper divisors (1).
120648730171 is an equidigital number, since it uses as much as digits as its factorization.
120648730171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56448, while the sum is 40.
The spelling of 120648730171 in words is "one hundred twenty billion, six hundred forty-eight million, seven hundred thirty thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •