Base | Representation |
---|---|
bin | 1100001100110… |
… | …01001100101101 |
3 | 21010120101020011 |
4 | 12012121030231 |
5 | 202144324443 |
6 | 14053253221 |
7 | 2351604343 |
oct | 606311455 |
9 | 233511204 |
10 | 102339373 |
11 | 5284a0a4 |
12 | 2a334211 |
13 | 18282556 |
14 | d83d993 |
15 | 8eb7b9d |
hex | 619932d |
102339373 has 4 divisors (see below), whose sum is σ = 105105340. Its totient is φ = 99573408.
The previous prime is 102339359. The next prime is 102339379. The reversal of 102339373 is 373933201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 373933201 = 257 ⋅1454993.
It can be written as a sum of positive squares in 2 ways, for example, as 79174404 + 23164969 = 8898^2 + 4813^2 .
It is a cyclic number.
It is not a de Polignac number, because 102339373 - 221 = 100242221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102339379) 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 in 3 ways as a sum of consecutive naturals, for example, 1382928 + ... + 1383001.
It is an arithmetic number, because the mean of its divisors is an integer number (26276335).
Almost surely, 2102339373 is an apocalyptic number.
It is an amenable number.
102339373 is a deficient number, since it is larger than the sum of its proper divisors (2765967).
102339373 is an equidigital number, since it uses as much as digits as its factorization.
102339373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2765966.
The product of its (nonzero) digits is 10206, while the sum is 31.
The square root of 102339373 is about 10116.2924532657. The cubic root of 102339373 is about 467.7504894575.
The spelling of 102339373 in words is "one hundred two million, three hundred thirty-nine thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •