Base | Representation |
---|---|
bin | 101010001110111… |
… | …0110001001110101 |
3 | 10122202112122122111 |
4 | 1110131312021311 |
5 | 10400240011013 |
6 | 352341331021 |
7 | 50055144265 |
oct | 12435661165 |
9 | 3582478574 |
10 | 1417110133 |
11 | 667a158aa |
12 | 336706a71 |
13 | 19778c70a |
14 | d62c77a5 |
15 | 8462473d |
hex | 54776275 |
1417110133 has 2 divisors, whose sum is σ = 1417110134. Its totient is φ = 1417110132.
The previous prime is 1417110083. The next prime is 1417110139. The reversal of 1417110133 is 3310117141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1290390084 + 126720049 = 35922^2 + 11257^2 .
It is a cyclic number.
It is not a de Polignac number, because 1417110133 - 229 = 880239221 is a prime.
It is a super-2 number, since 2×14171101332 = 4016402258102555378, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1417110139) 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, 708555066 + 708555067.
It is an arithmetic number, because the mean of its divisors is an integer number (708555067).
Almost surely, 21417110133 is an apocalyptic number.
It is an amenable number.
1417110133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1417110133 is an equidigital number, since it uses as much as digits as its factorization.
1417110133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 22.
The square root of 1417110133 is about 37644.5232802861. The cubic root of 1417110133 is about 1123.2278622477.
Adding to 1417110133 its reverse (3310117141), we get a palindrome (4727227274).
The spelling of 1417110133 in words is "one billion, four hundred seventeen million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •