Base | Representation |
---|---|
bin | 100101010000010… |
… | …0011111111010001 |
3 | 10020010012010020012 |
4 | 1022200203333101 |
5 | 10030003100001 |
6 | 324012524305 |
7 | 42656151434 |
oct | 11240437721 |
9 | 3203163205 |
10 | 1250050001 |
11 | 591691082 |
12 | 2aa780695 |
13 | 16bc99575 |
14 | bc03b81b |
15 | 74b252bb |
hex | 4a823fd1 |
1250050001 has 8 divisors (see below), whose sum is σ = 1323930600. Its totient is φ = 1176208128.
The previous prime is 1250049991. The next prime is 1250050007. The reversal of 1250050001 is 1000500521.
It can be written as a sum of positive squares in 4 ways, for example, as 625000000 + 625050001 = 25000^2 + 25001^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1250050001 - 210 = 1250048977 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1250050007) 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, 81275 + ... + 95423.
It is an arithmetic number, because the mean of its divisors is an integer number (165491325).
Almost surely, 21250050001 is an apocalyptic number.
1250050001 is the 25001-st centered square number.
It is an amenable number.
1250050001 is a deficient number, since it is larger than the sum of its proper divisors (73880599).
1250050001 is a wasteful number, since it uses less digits than its factorization.
1250050001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19363.
The product of its (nonzero) digits is 50, while the sum is 14.
The square root of 1250050001 is about 35356.0461731795. The cubic root of 1250050001 is about 1077.2317080096.
Adding to 1250050001 its reverse (1000500521), we get a palindrome (2250550522).
The spelling of 1250050001 in words is "one billion, two hundred fifty million, fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •