Base | Representation |
---|---|
bin | 101010000111010… |
… | …0101110100000001 |
3 | 10122111000110220222 |
4 | 1110032211310001 |
5 | 10343224023131 |
6 | 352115512425 |
7 | 50006150156 |
oct | 12416456401 |
9 | 3574013828 |
10 | 1413111041 |
11 | 665734271 |
12 | 3352b8715 |
13 | 1969bc3a4 |
14 | d596622d |
15 | 840d487b |
hex | 543a5d01 |
1413111041 has 2 divisors, whose sum is σ = 1413111042. Its totient is φ = 1413111040.
The previous prime is 1413110987. The next prime is 1413111061. The reversal of 1413111041 is 1401113141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1067002225 + 346108816 = 32665^2 + 18604^2 .
It is a cyclic number.
It is not a de Polignac number, because 1413111041 - 218 = 1412848897 is a prime.
It is a super-2 number, since 2×14131110412 = 3993765628392207362, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1413111061) 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 as a sum of consecutive naturals, namely, 706555520 + 706555521.
It is an arithmetic number, because the mean of its divisors is an integer number (706555521).
Almost surely, 21413111041 is an apocalyptic number.
It is an amenable number.
1413111041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413111041 is an equidigital number, since it uses as much as digits as its factorization.
1413111041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
The square root of 1413111041 is about 37591.3692355040. The cubic root of 1413111041 is about 1122.1702818779.
Adding to 1413111041 its reverse (1401113141), we get a palindrome (2814224182).
The spelling of 1413111041 in words is "one billion, four hundred thirteen million, one hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •