Base | Representation |
---|---|
bin | 1110010100011… |
… | …11011100101111 |
3 | 22101000222211122 |
4 | 13022033130233 |
5 | 221223001411 |
6 | 15530411155 |
7 | 2656022222 |
oct | 712173457 |
9 | 271028748 |
10 | 120125231 |
11 | 61897956 |
12 | 34290abb |
13 | 1bb6bc25 |
14 | 11d4d5b9 |
15 | a82c9db |
hex | 728f72f |
120125231 has 4 divisors (see below), whose sum is σ = 120262464. Its totient is φ = 119988000.
The previous prime is 120125219. The next prime is 120125249. The reversal of 120125231 is 132521021.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 120125231 - 26 = 120125167 is a prime.
It is a super-2 number, since 2×1201252312 = 28860142245606722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120125261) 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, 67295 + ... + 69056.
It is an arithmetic number, because the mean of its divisors is an integer number (30065616).
Almost surely, 2120125231 is an apocalyptic number.
120125231 is a deficient number, since it is larger than the sum of its proper divisors (137233).
120125231 is an equidigital number, since it uses as much as digits as its factorization.
120125231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137232.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 120125231 is about 10960.1656465584. The cubic root of 120125231 is about 493.4139364384.
Adding to 120125231 its reverse (132521021), we get a palindrome (252646252).
The spelling of 120125231 in words is "one hundred twenty million, one hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •