Base | Representation |
---|---|
bin | 101101110010000100… |
… | …0101010010001001111 |
3 | 100101202212022200122002 |
4 | 1123210020222101033 |
5 | 3102323042143142 |
6 | 113055513142515 |
7 | 10050244431506 |
oct | 1334410522117 |
9 | 311685280562 |
10 | 98316756047 |
11 | 38772277aa4 |
12 | 1707a0baa3b |
13 | 936ab7bbc3 |
14 | 4a8969b83d |
15 | 2856595a32 |
hex | 16e422a44f |
98316756047 has 8 divisors (see below), whose sum is σ = 104505158016. Its totient is φ = 92173361152.
The previous prime is 98316756001. The next prime is 98316756103. The reversal of 98316756047 is 74065761389.
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 98316756047 - 28 = 98316755791 is a prime.
It is a super-2 number, since 2×983167560472 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 98316755983 and 98316756001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (98316756847) 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, 11247263 + ... + 11256000.
It is an arithmetic number, because the mean of its divisors is an integer number (13063144752).
Almost surely, 298316756047 is an apocalyptic number.
98316756047 is a deficient number, since it is larger than the sum of its proper divisors (6188401969).
98316756047 is a wasteful number, since it uses less digits than its factorization.
98316756047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22503537.
The product of its (nonzero) digits is 7620480, while the sum is 56.
The spelling of 98316756047 in words is "ninety-eight billion, three hundred sixteen million, seven hundred fifty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •