Base | Representation |
---|---|
bin | 111110100001110… |
… | …1101010001001101 |
3 | 12102012222201211212 |
4 | 1331003231101031 |
5 | 13244104430403 |
6 | 544110024205 |
7 | 102664521110 |
oct | 17503552115 |
9 | 5365881755 |
10 | 2098123853 |
11 | 987377561 |
12 | 4a67a8065 |
13 | 2758b1c07 |
14 | 15c91c577 |
15 | c42e64d8 |
hex | 7d0ed44d |
2098123853 has 8 divisors (see below), whose sum is σ = 2437165440. Its totient is φ = 1768909680.
The previous prime is 2098123817. The next prime is 2098123861. The reversal of 2098123853 is 3583218902.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2098123853 - 28 = 2098123597 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2098123853.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2098123253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2456393 + ... + 2457246.
It is an arithmetic number, because the mean of its divisors is an integer number (304645680).
Almost surely, 22098123853 is an apocalyptic number.
It is an amenable number.
2098123853 is a deficient number, since it is larger than the sum of its proper divisors (339041587).
2098123853 is an equidigital number, since it uses as much as digits as its factorization.
2098123853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4913707.
The product of its (nonzero) digits is 103680, while the sum is 41.
The square root of 2098123853 is about 45805.2819334190. The cubic root of 2098123853 is about 1280.1976934641.
The spelling of 2098123853 in words is "two billion, ninety-eight million, one hundred twenty-three thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •