Base | Representation |
---|---|
bin | 101010000111011… |
… | …1110001111101101 |
3 | 10122111012120012111 |
4 | 1110032332033231 |
5 | 10343240223432 |
6 | 352122004021 |
7 | 50010045013 |
oct | 12416761755 |
9 | 3574176174 |
10 | 1413211117 |
11 | 6657a247a |
12 | 335346611 |
13 | 196a25ac6 |
14 | d59908b3 |
15 | 84104347 |
hex | 543be3ed |
1413211117 has 2 divisors, whose sum is σ = 1413211118. Its totient is φ = 1413211116.
The previous prime is 1413211091. The next prime is 1413211147. The reversal of 1413211117 is 7111123141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1256986116 + 156225001 = 35454^2 + 12499^2 .
It is a cyclic number.
It is not a de Polignac number, because 1413211117 - 219 = 1412686829 is a prime.
It is a super-2 number, since 2×14132111172 = 3994331322424775378, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1413211147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 706605558 + 706605559.
It is an arithmetic number, because the mean of its divisors is an integer number (706605559).
Almost surely, 21413211117 is an apocalyptic number.
It is an amenable number.
1413211117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1413211117 is an equidigital number, since it uses as much as digits as its factorization.
1413211117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 168, while the sum is 22.
The square root of 1413211117 is about 37592.7003153538. The cubic root of 1413211117 is about 1122.1967718137.
Adding to 1413211117 its reverse (7111123141), we get a palindrome (8524334258).
The spelling of 1413211117 in words is "one billion, four hundred thirteen million, two hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •