Base | Representation |
---|---|
bin | 1100001100000… |
… | …10100000100001 |
3 | 21010101122201221 |
4 | 12012002200201 |
5 | 202133341213 |
6 | 14051255041 |
7 | 2351036362 |
oct | 606024041 |
9 | 233348657 |
10 | 102246433 |
11 | 52796293 |
12 | 2a2aa481 |
13 | 1824c163 |
14 | d817b69 |
15 | 8e9a38d |
hex | 6182821 |
102246433 has 2 divisors, whose sum is σ = 102246434. Its totient is φ = 102246432.
The previous prime is 102246421. The next prime is 102246437. The reversal of 102246433 is 334642201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95101504 + 7144929 = 9752^2 + 2673^2 .
It is an emirp because it is prime and its reverse (334642201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102246433 is a prime.
It is a super-2 number, since 2×1022464332 = 20908666122446978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102246398 and 102246407.
It is not a weakly prime, because it can be changed into another prime (102246437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51123216 + 51123217.
It is an arithmetic number, because the mean of its divisors is an integer number (51123217).
Almost surely, 2102246433 is an apocalyptic number.
It is an amenable number.
102246433 is a deficient number, since it is larger than the sum of its proper divisors (1).
102246433 is an equidigital number, since it uses as much as digits as its factorization.
102246433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 25.
The square root of 102246433 is about 10111.6978297416. The cubic root of 102246433 is about 467.6088499436.
Adding to 102246433 its reverse (334642201), we get a palindrome (436888634).
The spelling of 102246433 in words is "one hundred two million, two hundred forty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •