Base | Representation |
---|---|
bin | 1110011010110… |
… | …00010000101011 |
3 | 22102120210010111 |
4 | 13031120100223 |
5 | 221430312010 |
6 | 20000155151 |
7 | 2666016235 |
oct | 715302053 |
9 | 272523114 |
10 | 120947755 |
11 | 622a9925 |
12 | 34608ab7 |
13 | 1c099426 |
14 | 120c5255 |
15 | a94158a |
hex | 735842b |
120947755 has 4 divisors (see below), whose sum is σ = 145137312. Its totient is φ = 96758200.
The previous prime is 120947713. The next prime is 120947759. The reversal of 120947755 is 557749021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 557749021 = 8999 ⋅61979.
It is not a de Polignac number, because 120947755 - 27 = 120947627 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120947759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12094771 + ... + 12094780.
It is an arithmetic number, because the mean of its divisors is an integer number (36284328).
Almost surely, 2120947755 is an apocalyptic number.
120947755 is a deficient number, since it is larger than the sum of its proper divisors (24189557).
120947755 is an equidigital number, since it uses as much as digits as its factorization.
120947755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24189556.
The product of its (nonzero) digits is 88200, while the sum is 40.
The square root of 120947755 is about 10997.6249708744. The cubic root of 120947755 is about 494.5375472067.
The spelling of 120947755 in words is "one hundred twenty million, nine hundred forty-seven thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •