Base | Representation |
---|---|
bin | 100001100010010… |
… | …1100101011000001 |
3 | 2220102110102021220 |
4 | 1003010230223001 |
5 | 4301034230100 |
6 | 303355105253 |
7 | 36612635445 |
oct | 10304545301 |
9 | 2812412256 |
10 | 1125305025 |
11 | 528229359 |
12 | 274a42229 |
13 | 14c1a0980 |
14 | a9648825 |
15 | 68bd3aa0 |
hex | 4312cac1 |
1125305025 has 24 divisors (see below), whose sum is σ = 2003621760. Its totient is φ = 553995840.
The previous prime is 1125305023. The next prime is 1125305029. The reversal of 1125305025 is 5205035211.
It is a happy number.
It is not a de Polignac number, because 1125305025 - 21 = 1125305023 is a prime.
It is a super-2 number, since 2×11253050252 = 2532622798580501250, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1125304986 and 1125305004.
It is not an unprimeable number, because it can be changed into a prime (1125305023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 576105 + ... + 578054.
It is an arithmetic number, because the mean of its divisors is an integer number (83484240).
Almost surely, 21125305025 is an apocalyptic number.
1125305025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1125305025 is a deficient number, since it is larger than the sum of its proper divisors (878316735).
1125305025 is a wasteful number, since it uses less digits than its factorization.
1125305025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1154185 (or 1154180 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 24.
The square root of 1125305025 is about 33545.5663985571. The cubic root of 1125305025 is about 1040.1358997088.
The spelling of 1125305025 in words is "one billion, one hundred twenty-five million, three hundred five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •