Base | Representation |
---|---|
bin | 101110000011110010… |
… | …0010101110000110111 |
3 | 100110022021220022112021 |
4 | 1130013210111300313 |
5 | 3110032232332042 |
6 | 113234510334011 |
7 | 10101053311120 |
oct | 1340744256067 |
9 | 313267808467 |
10 | 98911214647 |
11 | 38a478905a3 |
12 | 172051ba307 |
13 | 943408745b |
14 | 4b04601047 |
15 | 288d86b867 |
hex | 1707915c37 |
98911214647 has 4 divisors (see below), whose sum is σ = 113041388176. Its totient is φ = 84781041120.
The previous prime is 98911214557. The next prime is 98911214671. The reversal of 98911214647 is 74641211989.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 74641211989 = 17623 ⋅4235443.
It is a cyclic number.
It is not a de Polignac number, because 98911214647 - 211 = 98911212599 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 98911214594 and 98911214603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (98911214687) 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, 7065086754 + ... + 7065086767.
It is an arithmetic number, because the mean of its divisors is an integer number (28260347044).
Almost surely, 298911214647 is an apocalyptic number.
98911214647 is a deficient number, since it is larger than the sum of its proper divisors (14130173529).
98911214647 is a wasteful number, since it uses less digits than its factorization.
98911214647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14130173528.
The product of its digits is 870912, while the sum is 52.
The spelling of 98911214647 in words is "ninety-eight billion, nine hundred eleven million, two hundred fourteen thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •