Base | Representation |
---|---|
bin | 101010001101101… |
… | …0011010011101101 |
3 | 10122201021202200012 |
4 | 1110123103103231 |
5 | 10400102134432 |
6 | 352315143005 |
7 | 50046365525 |
oct | 12433232355 |
9 | 3581252605 |
10 | 1416443117 |
11 | 6675aa751 |
12 | 336444a65 |
13 | 1975b7c2b |
14 | d6192685 |
15 | 84541cb2 |
hex | 546d34ed |
1416443117 has 2 divisors, whose sum is σ = 1416443118. Its totient is φ = 1416443116.
The previous prime is 1416443087. The next prime is 1416443123. The reversal of 1416443117 is 7113446141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1170392521 + 246050596 = 34211^2 + 15686^2 .
It is a cyclic number.
It is not a de Polignac number, because 1416443117 - 26 = 1416443053 is a prime.
It is a super-2 number, since 2×14164431172 = 4012622207393351378, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1416440117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 708221558 + 708221559.
It is an arithmetic number, because the mean of its divisors is an integer number (708221559).
Almost surely, 21416443117 is an apocalyptic number.
It is an amenable number.
1416443117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1416443117 is an equidigital number, since it uses as much as digits as its factorization.
1416443117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8064, while the sum is 32.
The square root of 1416443117 is about 37635.6628346041. The cubic root of 1416443117 is about 1123.0516048261.
Adding to 1416443117 its reverse (7113446141), we get a palindrome (8529889258).
The spelling of 1416443117 in words is "one billion, four hundred sixteen million, four hundred forty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •