Base | Representation |
---|---|
bin | 101010000111101… |
… | …0100001100100001 |
3 | 10122111101010112102 |
4 | 1110033110030201 |
5 | 10343301113100 |
6 | 352123540145 |
7 | 50010601103 |
oct | 12417241441 |
9 | 3574333472 |
10 | 1413301025 |
11 | 665853a84 |
12 | 33538a655 |
13 | 196a579c6 |
14 | d59b5573 |
15 | 84120cd5 |
hex | 543d4321 |
1413301025 has 12 divisors (see below), whose sum is σ = 1799859132. Its totient is φ = 1100082240.
The previous prime is 1413301013. The next prime is 1413301039. The reversal of 1413301025 is 5201033141.
It can be written as a sum of positive squares in 6 ways, for example, as 10349089 + 1402951936 = 3217^2 + 37456^2 .
It is a de Polignac number, because none of the positive numbers 2k-1413301025 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1413300988 and 1413301006.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 763022 + ... + 764871.
It is an arithmetic number, because the mean of its divisors is an integer number (149988261).
Almost surely, 21413301025 is an apocalyptic number.
It is an amenable number.
1413301025 is a deficient number, since it is larger than the sum of its proper divisors (386558107).
1413301025 is a wasteful number, since it uses less digits than its factorization.
1413301025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1527940 (or 1527935 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
The square root of 1413301025 is about 37593.8961135980. The cubic root of 1413301025 is about 1122.2205692319.
Adding to 1413301025 its reverse (5201033141), we get a palindrome (6614334166).
The spelling of 1413301025 in words is "one billion, four hundred thirteen million, three hundred one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •