Base | Representation |
---|---|
bin | 100110110000100… |
… | …0011110101111101 |
3 | 10100122010212020202 |
4 | 1031201003311331 |
5 | 10130412342000 |
6 | 333014253245 |
7 | 44141112353 |
oct | 11541036575 |
9 | 3318125222 |
10 | 1300512125 |
11 | 608118010 |
12 | 303657225 |
13 | 179587103 |
14 | c4a157d3 |
15 | 79291dd5 |
hex | 4d843d7d |
1300512125 has 32 divisors (see below), whose sum is σ = 1774386432. Its totient is φ = 943800000.
The previous prime is 1300512107. The next prime is 1300512127. The reversal of 1300512125 is 5212150031.
It is a happy number.
It is not a de Polignac number, because 1300512125 - 28 = 1300511869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1300512097 and 1300512106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300512127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 998975 + ... + 1000275.
It is an arithmetic number, because the mean of its divisors is an integer number (55449576).
Almost surely, 21300512125 is an apocalyptic number.
It is an amenable number.
1300512125 is a deficient number, since it is larger than the sum of its proper divisors (473874307).
1300512125 is a wasteful number, since it uses less digits than its factorization.
1300512125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2054 (or 2044 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
The square root of 1300512125 is about 36062.6139512931. The cubic root of 1300512125 is about 1091.5361795229.
Adding to 1300512125 its reverse (5212150031), we get a palindrome (6512662156).
The spelling of 1300512125 in words is "one billion, three hundred million, five hundred twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •