Base | Representation |
---|---|
bin | 110010001010… |
… | …011110100101 |
3 | 220202002120101 |
4 | 302022132211 |
5 | 11331300432 |
6 | 1145504101 |
7 | 216526351 |
oct | 62123645 |
9 | 26662511 |
10 | 13150117 |
11 | 7471972 |
12 | 44a2031 |
13 | 2955646 |
14 | 1a64461 |
15 | 124b4e7 |
hex | c8a7a5 |
13150117 has 2 divisors, whose sum is σ = 13150118. Its totient is φ = 13150116.
The previous prime is 13150091. The next prime is 13150139. The reversal of 13150117 is 71105131.
13150117 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11383876 + 1766241 = 3374^2 + 1329^2 .
It is a cyclic number.
It is not a de Polignac number, because 13150117 - 223 = 4761509 is a prime.
It is a super-2 number, since 2×131501172 = 345851154227378, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13150094 and 13150103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13154117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6575058 + 6575059.
It is an arithmetic number, because the mean of its divisors is an integer number (6575059).
Almost surely, 213150117 is an apocalyptic number.
It is an amenable number.
13150117 is a deficient number, since it is larger than the sum of its proper divisors (1).
13150117 is an equidigital number, since it uses as much as digits as its factorization.
13150117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 105, while the sum is 19.
The square root of 13150117 is about 3626.3090050353. The cubic root of 13150117 is about 236.0350721122.
Adding to 13150117 its reverse (71105131), we get a palindrome (84255248).
The spelling of 13150117 in words is "thirteen million, one hundred fifty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •