Base | Representation |
---|---|
bin | 100001011010001… |
… | …1000111110001001 |
3 | 2220010102020002120 |
4 | 1002310120332021 |
5 | 4243440430100 |
6 | 303123321453 |
7 | 36531412053 |
oct | 10264307611 |
9 | 2803366076 |
10 | 1121030025 |
11 | 5258794a5 |
12 | 273520289 |
13 | 14b334b9b |
14 | a8c548d3 |
15 | 6863c0a0 |
hex | 42d18f89 |
1121030025 has 24 divisors (see below), whose sum is σ = 1856753184. Its totient is φ = 596812800.
The previous prime is 1121030023. The next prime is 1121030069. The reversal of 1121030025 is 5200301211.
It is not a de Polignac number, because 1121030025 - 21 = 1121030023 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a junction number, because it is equal to n+sod(n) for n = 1121029986 and 1121030013.
It is not an unprimeable number, because it can be changed into a prime (1121030021) 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, 29737 + ... + 55913.
It is an arithmetic number, because the mean of its divisors is an integer number (77364716).
Almost surely, 21121030025 is an apocalyptic number.
1121030025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1121030025 is a deficient number, since it is larger than the sum of its proper divisors (735723159).
1121030025 is a wasteful number, since it uses less digits than its factorization.
1121030025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26761 (or 26756 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 1121030025 is about 33481.7864666747. The cubic root of 1121030025 is about 1038.8170798938.
Adding to 1121030025 its reverse (5200301211), we get a palindrome (6321331236).
The spelling of 1121030025 in words is "one billion, one hundred twenty-one million, thirty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •