Base | Representation |
---|---|
bin | 1011101100100… |
… | …00010100011101 |
3 | 20211121102211121 |
4 | 11312100110131 |
5 | 200103434301 |
6 | 13422450541 |
7 | 2300624125 |
oct | 566202435 |
9 | 224542747 |
10 | 98108701 |
11 | 5041a579 |
12 | 28a33a51 |
13 | 174309b2 |
14 | d05bc85 |
15 | 892e3a1 |
hex | 5d9051d |
98108701 has 4 divisors (see below), whose sum is σ = 98128512. Its totient is φ = 98088892.
The previous prime is 98108669. The next prime is 98108729. The reversal of 98108701 is 10780189.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 10780189 = 7 ⋅1540027.
It is a cyclic number.
It is not a de Polignac number, because 98108701 - 25 = 98108669 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 (98108771) 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, 4926 + ... + 14848.
It is an arithmetic number, because the mean of its divisors is an integer number (24532128).
Almost surely, 298108701 is an apocalyptic number.
It is an amenable number.
98108701 is a deficient number, since it is larger than the sum of its proper divisors (19811).
98108701 is an equidigital number, since it uses as much as digits as its factorization.
98108701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19810.
The product of its (nonzero) digits is 4032, while the sum is 34.
The square root of 98108701 is about 9904.9836446104. The cubic root of 98108701 is about 461.2140284764.
The spelling of 98108701 in words is "ninety-eight million, one hundred eight thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.010 sec. • engine limits •