Base | Representation |
---|---|
bin | 101111110100110010… |
… | …1101101001000111111 |
3 | 100211002120020022120101 |
4 | 1133221211231020333 |
5 | 3140314011121414 |
6 | 115103050301531 |
7 | 10264036665112 |
oct | 1375145551077 |
9 | 324076208511 |
10 | 102703223359 |
11 | 3a6133238a0 |
12 | 17aa31278a7 |
13 | 98b98843a9 |
14 | 4d84092579 |
15 | 2a11709a74 |
hex | 17e996d23f |
102703223359 has 4 divisors (see below), whose sum is σ = 112039880040. Its totient is φ = 93366566680.
The previous prime is 102703223353. The next prime is 102703223393. The reversal of 102703223359 is 953322307201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 953322307201 = 11 ⋅86665664291.
It is a cyclic number.
It is not a de Polignac number, because 102703223359 - 25 = 102703223327 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102703223353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4668328324 + ... + 4668328345.
It is an arithmetic number, because the mean of its divisors is an integer number (28009970010).
Almost surely, 2102703223359 is an apocalyptic number.
102703223359 is a deficient number, since it is larger than the sum of its proper divisors (9336656681).
102703223359 is an equidigital number, since it uses as much as digits as its factorization.
102703223359 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9336656680.
The product of its (nonzero) digits is 68040, while the sum is 37.
The spelling of 102703223359 in words is "one hundred two billion, seven hundred three million, two hundred twenty-three thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •