Base | Representation |
---|---|
bin | 10110011001001110111100… |
… | …001010111010110101101011 |
3 | 110220201122121202112002222120 |
4 | 112121032330022322311223 |
5 | 100402134133310344002 |
6 | 545250055323122323 |
7 | 26513513041141305 |
oct | 2631167412726553 |
9 | 426648552462876 |
10 | 98491052043627 |
11 | 29422903249821 |
12 | b0682860733a3 |
13 | 42c5887ca19c9 |
14 | 1a46dc703a975 |
15 | b5bea1ac8cbc |
hex | 5993bc2bad6b |
98491052043627 has 4 divisors (see below), whose sum is σ = 131321402724840. Its totient is φ = 65660701362416.
The previous prime is 98491052043613. The next prime is 98491052043691. The reversal of 98491052043627 is 72634025019489.
It is a happy number.
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 98491052043627 - 27 = 98491052043499 is a prime.
It is a super-2 number, since 2×984910520436272 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (98491052043227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16415175340602 + ... + 16415175340607.
It is an arithmetic number, because the mean of its divisors is an integer number (32830350681210).
It is a 1-persistent number, because it is pandigital, but 2⋅98491052043627 = 196982104087254 is not.
Almost surely, 298491052043627 is an apocalyptic number.
98491052043627 is a deficient number, since it is larger than the sum of its proper divisors (32830350681213).
98491052043627 is a wasteful number, since it uses less digits than its factorization.
98491052043627 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32830350681212.
The product of its (nonzero) digits is 26127360, while the sum is 60.
The spelling of 98491052043627 in words is "ninety-eight trillion, four hundred ninety-one billion, fifty-two million, forty-three thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •