Base | Representation |
---|---|
bin | 101010000111110… |
… | …0000010000001101 |
3 | 10122111110122021121 |
4 | 1110033200100031 |
5 | 10343304203123 |
6 | 352125000541 |
7 | 50011165066 |
oct | 12417402015 |
9 | 3574418247 |
10 | 1413350413 |
11 | 6658880a2 |
12 | 3353b3151 |
13 | 196a74327 |
14 | d59c956d |
15 | 8413075d |
hex | 543e040d |
1413350413 has 2 divisors, whose sum is σ = 1413350414. Its totient is φ = 1413350412.
The previous prime is 1413350347. The next prime is 1413350423. The reversal of 1413350413 is 3140533141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1366263369 + 47087044 = 36963^2 + 6862^2 .
It is an emirp because it is prime and its reverse (3140533141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1413350413 - 229 = 876479501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1413350423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 706675206 + 706675207.
It is an arithmetic number, because the mean of its divisors is an integer number (706675207).
Almost surely, 21413350413 is an apocalyptic number.
It is an amenable number.
1413350413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413350413 is an equidigital number, since it uses as much as digits as its factorization.
1413350413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 1413350413 is about 37594.5529698120. The cubic root of 1413350413 is about 1122.2336411307.
Adding to 1413350413 its reverse (3140533141), we get a palindrome (4553883554).
It can be divided in two parts, 14133 and 50413, that added together give a palindrome (64546).
The spelling of 1413350413 in words is "one billion, four hundred thirteen million, three hundred fifty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •