Base | Representation |
---|---|
bin | 1110010100011… |
… | …11110111110001 |
3 | 22101001002012201 |
4 | 13022033313301 |
5 | 221223030321 |
6 | 15530423201 |
7 | 2656030243 |
oct | 712176761 |
9 | 271032181 |
10 | 120126961 |
11 | 61899189 |
12 | 34291b01 |
13 | 1bb6c956 |
14 | 11d50093 |
15 | a82d291 |
hex | 728fdf1 |
120126961 has 4 divisors (see below), whose sum is σ = 124269300. Its totient is φ = 115984624.
The previous prime is 120126931. The next prime is 120126989. The reversal of 120126961 is 169621021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 66324736 + 53802225 = 8144^2 + 7335^2 .
It is a cyclic number.
It is not a de Polignac number, because 120126961 - 211 = 120124913 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (120126931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2071126 + ... + 2071183.
It is an arithmetic number, because the mean of its divisors is an integer number (31067325).
Almost surely, 2120126961 is an apocalyptic number.
It is an amenable number.
120126961 is a deficient number, since it is larger than the sum of its proper divisors (4142339).
120126961 is an equidigital number, since it uses as much as digits as its factorization.
120126961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4142338.
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 120126961 is about 10960.2445684392. The cubic root of 120126961 is about 493.4163050832.
Adding to 120126961 its reverse (169621021), we get a palindrome (289747982).
The spelling of 120126961 in words is "one hundred twenty million, one hundred twenty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •