Base | Representation |
---|---|
bin | 100001100010010… |
… | …0010000011010101 |
3 | 2220102101012121210 |
4 | 1003010202003111 |
5 | 4301031332100 |
6 | 303354132033 |
7 | 36612364563 |
oct | 10304420325 |
9 | 2812335553 |
10 | 1125261525 |
11 | 5281a9703 |
12 | 274a21019 |
13 | 14c186c2b |
14 | a9636a33 |
15 | 68bc5c50 |
hex | 431220d5 |
1125261525 has 24 divisors (see below), whose sum is σ = 1864282464. Its totient is φ = 598897600.
The previous prime is 1125261517. The next prime is 1125261563. The reversal of 1125261525 is 5251625211.
It is not a de Polignac number, because 1125261525 - 23 = 1125261517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1125261492 and 1125261501.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21547 + ... + 52103.
It is an arithmetic number, because the mean of its divisors is an integer number (77678436).
Almost surely, 21125261525 is an apocalyptic number.
1125261525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1125261525 is a deficient number, since it is larger than the sum of its proper divisors (739020939).
1125261525 is a wasteful number, since it uses less digits than its factorization.
1125261525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31061 (or 31056 counting only the distinct ones).
The product of its digits is 6000, while the sum is 30.
The square root of 1125261525 is about 33544.9180204692. The cubic root of 1125261525 is about 1040.1224969739.
Adding to 1125261525 its reverse (5251625211), we get a palindrome (6376886736).
The spelling of 1125261525 in words is "one billion, one hundred twenty-five million, two hundred sixty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •