Base | Representation |
---|---|
bin | 1100001011111… |
… | …01000110000101 |
3 | 21010100112022202 |
4 | 12011331012011 |
5 | 202132134021 |
6 | 14051004245 |
7 | 2350614626 |
oct | 605750605 |
9 | 233315282 |
10 | 102224261 |
11 | 52780667 |
12 | 2a299685 |
13 | 18242039 |
14 | d80da4d |
15 | 8e93a0b |
hex | 617d185 |
102224261 has 2 divisors, whose sum is σ = 102224262. Its totient is φ = 102224260.
The previous prime is 102224257. The next prime is 102224321. The reversal of 102224261 is 162422201.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102131236 + 93025 = 10106^2 + 305^2 .
It is a cyclic number.
It is not a de Polignac number, because 102224261 - 22 = 102224257 is a prime.
It is a super-2 number, since 2×1022242612 = 20899599073992242, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102224231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51112130 + 51112131.
It is an arithmetic number, because the mean of its divisors is an integer number (51112131).
Almost surely, 2102224261 is an apocalyptic number.
It is an amenable number.
102224261 is a deficient number, since it is larger than the sum of its proper divisors (1).
102224261 is an equidigital number, since it uses as much as digits as its factorization.
102224261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 102224261 is about 10110.6014163352. The cubic root of 102224261 is about 467.5750473857.
Adding to 102224261 its reverse (162422201), we get a palindrome (264646462).
The spelling of 102224261 in words is "one hundred two million, two hundred twenty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •