Base | Representation |
---|---|
bin | 111110101001011… |
… | …1000110010110111 |
3 | 12102111110220111221 |
4 | 1331102320302313 |
5 | 13301114300343 |
6 | 544331211211 |
7 | 103043403553 |
oct | 17522706267 |
9 | 5374426457 |
10 | 2102103223 |
11 | 9896452a0 |
12 | 4a7ba6b07 |
13 | 27667627c |
14 | 15d276863 |
15 | c48305ed |
hex | 7d4b8cb7 |
2102103223 has 4 divisors (see below), whose sum is σ = 2293203528. Its totient is φ = 1911002920.
The previous prime is 2102103217. The next prime is 2102103233. The reversal of 2102103223 is 3223012012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2102103223 - 25 = 2102103191 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2102103197 and 2102103206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102103233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 95550136 + ... + 95550157.
It is an arithmetic number, because the mean of its divisors is an integer number (573300882).
Almost surely, 22102103223 is an apocalyptic number.
2102103223 is a deficient number, since it is larger than the sum of its proper divisors (191100305).
2102103223 is a wasteful number, since it uses less digits than its factorization.
2102103223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191100304.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2102103223 is about 45848.6992509057. The cubic root of 2102103223 is about 1281.0065371929.
Adding to 2102103223 its reverse (3223012012), we get a palindrome (5325115235).
The spelling of 2102103223 in words is "two billion, one hundred two million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •