Base | Representation |
---|---|
bin | 100001100000001… |
… | …0001011111100101 |
3 | 2220100021111012122 |
4 | 1003000101133211 |
5 | 4300240121000 |
6 | 303314155325 |
7 | 36600035015 |
oct | 10300213745 |
9 | 2810244178 |
10 | 1124145125 |
11 | 527606964 |
12 | 274582b45 |
13 | 14bb85a3c |
14 | a9425c45 |
15 | 68a55085 |
hex | 430117e5 |
1124145125 has 64 divisors (see below), whose sum is σ = 1541030400. Its totient is φ = 816076800.
The previous prime is 1124145101. The next prime is 1124145133. The reversal of 1124145125 is 5215414211.
It is a happy number.
It is not a de Polignac number, because 1124145125 - 220 = 1123096549 is a prime.
It is a super-2 number, since 2×11241451252 = 2527404524122531250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1124145094 and 1124145103.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 8087306 + ... + 8087444.
It is an arithmetic number, because the mean of its divisors is an integer number (24078600).
Almost surely, 21124145125 is an apocalyptic number.
It is an amenable number.
1124145125 is a deficient number, since it is larger than the sum of its proper divisors (416885275).
1124145125 is a wasteful number, since it uses less digits than its factorization.
1124145125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303 (or 293 counting only the distinct ones).
The product of its digits is 1600, while the sum is 26.
The square root of 1124145125 is about 33528.2735165412. The cubic root of 1124145125 is about 1039.7784060055.
Adding to 1124145125 its reverse (5215414211), we get a palindrome (6339559336).
The spelling of 1124145125 in words is "one billion, one hundred twenty-four million, one hundred forty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •