Base | Representation |
---|---|
bin | 1110010100100… |
… | …00111100001101 |
3 | 22101001022012221 |
4 | 13022100330031 |
5 | 221223200331 |
6 | 15530455341 |
7 | 2656046101 |
oct | 712207415 |
9 | 271038187 |
10 | 120131341 |
11 | 618a1500 |
12 | 34294551 |
13 | 1bb71945 |
14 | 11d51901 |
15 | a82e711 |
hex | 7290f0d |
120131341 has 12 divisors (see below), whose sum is σ = 135619036. Its totient is φ = 106254720.
The previous prime is 120131279. The next prime is 120131383. The reversal of 120131341 is 143131021.
It can be written as a sum of positive squares in 2 ways, for example, as 58446025 + 61685316 = 7645^2 + 7854^2 .
It is not a de Polignac number, because 120131341 - 27 = 120131213 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 (120131441) 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 11 ways as a sum of consecutive naturals, for example, 8940 + ... + 17893.
Almost surely, 2120131341 is an apocalyptic number.
120131341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120131341 is a deficient number, since it is larger than the sum of its proper divisors (15487695).
120131341 is a wasteful number, since it uses less digits than its factorization.
120131341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26892 (or 26881 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 120131341 is about 10960.4443796773. Note that the first 3 decimals coincide. The cubic root of 120131341 is about 493.4223018972.
Adding to 120131341 its reverse (143131021), we get a palindrome (263262362).
The spelling of 120131341 in words is "one hundred twenty million, one hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •