Base | Representation |
---|---|
bin | 111110100101011… |
… | …100000000000101 |
3 | 2201011202121011020 |
4 | 332211130000011 |
5 | 4122300021123 |
6 | 252105101353 |
7 | 35006602416 |
oct | 7645340005 |
9 | 2634677136 |
10 | 1050001413 |
11 | 49977566a |
12 | 253787859 |
13 | 1396c6116 |
14 | 9d64580d |
15 | 622ab7e3 |
hex | 3e95c005 |
1050001413 has 32 divisors (see below), whose sum is σ = 1514217600. Its totient is φ = 644806656.
The previous prime is 1050001397. The next prime is 1050001417. The reversal of 1050001413 is 3141000501.
It is not a de Polignac number, because 1050001413 - 24 = 1050001397 is a prime.
It is a super-2 number, since 2×10500014132 = 2205005934603993138, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1050001392 and 1050001401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050001417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 516483 + ... + 518511.
It is an arithmetic number, because the mean of its divisors is an integer number (47319300).
Almost surely, 21050001413 is an apocalyptic number.
It is an amenable number.
1050001413 is a deficient number, since it is larger than the sum of its proper divisors (464216187).
1050001413 is a wasteful number, since it uses less digits than its factorization.
1050001413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2261.
The product of its (nonzero) digits is 60, while the sum is 15.
The square root of 1050001413 is about 32403.7252950953. The cubic root of 1050001413 is about 1016.3968127410.
Adding to 1050001413 its reverse (3141000501), we get a palindrome (4191001914).
The spelling of 1050001413 in words is "one billion, fifty million, one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •