Base | Representation |
---|---|
bin | 100001011110111… |
… | …1010000110111101 |
3 | 2220022002222122000 |
4 | 1002331322012331 |
5 | 4300110300203 |
6 | 303253012513 |
7 | 36561543150 |
oct | 10275720675 |
9 | 2808088560 |
10 | 1123525053 |
11 | 527223002 |
12 | 274324139 |
13 | 14b9c9731 |
14 | a9303c97 |
15 | 689814a3 |
hex | 42f7a1bd |
1123525053 has 64 divisors (see below), whose sum is σ = 2037312000. Its totient is φ = 597307392.
The previous prime is 1123525049. The next prime is 1123525057. The reversal of 1123525053 is 3505253211.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1123525049) and next prime (1123525057).
It is not a de Polignac number, because 1123525053 - 22 = 1123525049 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123525057) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 283993 + ... + 287921.
It is an arithmetic number, because the mean of its divisors is an integer number (31833000).
Almost surely, 21123525053 is an apocalyptic number.
It is an amenable number.
1123525053 is a deficient number, since it is larger than the sum of its proper divisors (913786947).
1123525053 is a wasteful number, since it uses less digits than its factorization.
1123525053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4051 (or 4045 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The square root of 1123525053 is about 33519.0252394069. The cubic root of 1123525053 is about 1039.5871922431.
Adding to 1123525053 its reverse (3505253211), we get a palindrome (4628778264).
The spelling of 1123525053 in words is "one billion, one hundred twenty-three million, five hundred twenty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •