Base | Representation |
---|---|
bin | 1100001011000… |
… | …10100001110001 |
3 | 21010011000001101 |
4 | 12011202201301 |
5 | 202120143231 |
6 | 14044404401 |
7 | 2346652441 |
oct | 605424161 |
9 | 233130041 |
10 | 102115441 |
11 | 5270692a |
12 | 2a246701 |
13 | 1820464c |
14 | d7c2121 |
15 | 8e71661 |
hex | 6162871 |
102115441 has 2 divisors, whose sum is σ = 102115442. Its totient is φ = 102115440.
The previous prime is 102115427. The next prime is 102115463. The reversal of 102115441 is 144511201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94497841 + 7617600 = 9721^2 + 2760^2 .
It is an emirp because it is prime and its reverse (144511201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102115441 is a prime.
It is a super-3 number, since 3×1021154413 (a number of 25 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (102119441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51057720 + 51057721.
It is an arithmetic number, because the mean of its divisors is an integer number (51057721).
Almost surely, 2102115441 is an apocalyptic number.
It is an amenable number.
102115441 is a deficient number, since it is larger than the sum of its proper divisors (1).
102115441 is an equidigital number, since it uses as much as digits as its factorization.
102115441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 160, while the sum is 19.
The square root of 102115441 is about 10105.2185033279. The cubic root of 102115441 is about 467.4090737975.
Adding to 102115441 its reverse (144511201), we get a palindrome (246626642).
The spelling of 102115441 in words is "one hundred two million, one hundred fifteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •