Base | Representation |
---|---|
bin | 111100001110000… |
… | …000000010010101 |
3 | 2121102001201100021 |
4 | 330032000002111 |
5 | 4032114200000 |
6 | 244130145141 |
7 | 34015302106 |
oct | 7416000225 |
9 | 2542051307 |
10 | 1010303125 |
11 | 479320767 |
12 | 2424221b1 |
13 | 131406a00 |
14 | 982703ad |
15 | 5da6911a |
hex | 3c380095 |
1010303125 has 36 divisors (see below), whose sum is σ = 1368123372. Its totient is φ = 745680000.
The previous prime is 1010303071. The next prime is 1010303159. The reversal of 1010303125 is 5213030101.
It can be written as a sum of positive squares in 18 ways, for example, as 746273124 + 264030001 = 27318^2 + 16249^2 .
It is not a de Polignac number, because 1010303125 - 211 = 1010301077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1010303099 and 1010303108.
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 35 ways as a sum of consecutive naturals, for example, 527169 + ... + 529081.
It is an arithmetic number, because the mean of its divisors is an integer number (38003427).
Almost surely, 21010303125 is an apocalyptic number.
It is an amenable number.
1010303125 is a deficient number, since it is larger than the sum of its proper divisors (357820247).
1010303125 is an frugal number, since it uses more digits than its factorization.
1010303125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1964 (or 1931 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 1010303125 is about 31785.2658475590. The cubic root of 1010303125 is about 1003.4226471218.
Adding to 1010303125 its reverse (5213030101), we get a palindrome (6223333226).
The spelling of 1010303125 in words is "one billion, ten million, three hundred three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •