Base | Representation |
---|---|
bin | 111011100111001… |
… | …110111101010001 |
3 | 2120200221102000101 |
4 | 323213032331101 |
5 | 4022014000000 |
6 | 243124252401 |
7 | 33533024611 |
oct | 7347167521 |
9 | 2520842011 |
10 | 1000140625 |
11 | 47360a500 |
12 | 23ab41101 |
13 | 12c2891b3 |
14 | 96b86a41 |
15 | 5cc0ce6a |
hex | 3b9cef51 |
1000140625 has 63 divisors (see below), whose sum is σ = 1436485519. Its totient is φ = 695750000.
The previous prime is 1000140623. The next prime is 1000140643. The reversal of 1000140625 is 5260410001.
The square root of 1000140625 is 31625.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 3 ways, for example, as 876219201 + 123921424 = 29601^2 + 11132^2 .
It is not a de Polignac number, because 1000140625 - 21 = 1000140623 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000140623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 43484364 + ... + 43484386.
Almost surely, 21000140625 is an apocalyptic number.
1000140625 is the 31625-th square number.
1000140625 is the 15813-rd centered octagonal number.
It is an amenable number.
1000140625 is a deficient number, since it is larger than the sum of its proper divisors (436344894).
1000140625 is an frugal number, since it uses more digits than its factorization.
1000140625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98 (or 39 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
The cubic root of 1000140625 is about 1000.0468728029.
Adding to 1000140625 its reverse (5260410001), we get a palindrome (6260550626).
The spelling of 1000140625 in words is "one billion, one hundred forty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •