Base | Representation |
---|---|
bin | 101100111010… |
… | …000011011101 |
3 | 211011002022122 |
4 | 230322003131 |
5 | 11003202000 |
6 | 1100152325 |
7 | 202030031 |
oct | 54720335 |
9 | 24132278 |
10 | 11772125 |
11 | 6710632 |
12 | 3b386a5 |
13 | 2592371 |
14 | 17c61c1 |
15 | 1078085 |
hex | b3a0dd |
11772125 has 16 divisors (see below), whose sum is σ = 15056496. Its totient is φ = 9184000.
The previous prime is 11772121. The next prime is 11772133. The reversal of 11772125 is 52127711.
It can be written as a sum of positive squares in 8 ways, for example, as 7252249 + 4519876 = 2693^2 + 2126^2 .
It is not a de Polignac number, because 11772125 - 22 = 11772121 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11772094 and 11772103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11772121) 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 15 ways as a sum of consecutive naturals, for example, 3977 + ... + 6273.
It is an arithmetic number, because the mean of its divisors is an integer number (941031).
Almost surely, 211772125 is an apocalyptic number.
It is an amenable number.
11772125 is a deficient number, since it is larger than the sum of its proper divisors (3284371).
11772125 is an equidigital number, since it uses as much as digits as its factorization.
11772125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2353 (or 2343 counting only the distinct ones).
The product of its digits is 980, while the sum is 26.
The square root of 11772125 is about 3431.0530453492. The cubic root of 11772125 is about 227.4844009753.
Adding to 11772125 its reverse (52127711), we get a palindrome (63899836).
The spelling of 11772125 in words is "eleven million, seven hundred seventy-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •