Base | Representation |
---|---|
bin | 100001101011111… |
… | …0000001011011101 |
3 | 2220202212012021121 |
4 | 1003113300023131 |
5 | 4303324101000 |
6 | 304054130541 |
7 | 40003251433 |
oct | 10327601335 |
9 | 2822765247 |
10 | 1130300125 |
11 | 530030239 |
12 | 276650a51 |
13 | 15022c456 |
14 | aa188d53 |
15 | 6936db1a |
hex | 435f02dd |
1130300125 has 8 divisors (see below), whose sum is σ = 1410614712. Its totient is φ = 904240000.
The previous prime is 1130300123. The next prime is 1130300137. The reversal of 1130300125 is 5210030311.
It can be written as a sum of positive squares in 4 ways, for example, as 12802084 + 1117498041 = 3578^2 + 33429^2 .
It is not a de Polignac number, because 1130300125 - 21 = 1130300123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1130300099 and 1130300108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1130300123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4521076 + ... + 4521325.
It is an arithmetic number, because the mean of its divisors is an integer number (176326839).
Almost surely, 21130300125 is an apocalyptic number.
It is an amenable number.
1130300125 is a deficient number, since it is larger than the sum of its proper divisors (280314587).
1130300125 is an frugal number, since it uses more digits than its factorization.
1130300125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9042416 (or 9042406 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 1130300125 is about 33619.9364217126. The cubic root of 1130300125 is about 1041.6726428102.
Adding to 1130300125 its reverse (5210030311), we get a palindrome (6340330436).
The spelling of 1130300125 in words is "one billion, one hundred thirty million, three hundred thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •