Base | Representation |
---|---|
bin | 10110000111110001001000… |
… | …000110010101011001111011 |
3 | 110202110220120202010101221022 |
4 | 112013301020012111121323 |
5 | 100223003034023342313 |
6 | 542530440333133055 |
7 | 26331012640031531 |
oct | 2607611006253173 |
9 | 422426522111838 |
10 | 97290808809083 |
11 | 28aaa88922aa4a |
12 | aab373b02a18b |
13 | 423963a1a2b46 |
14 | 1a04c864b8151 |
15 | b3ab55893c08 |
hex | 587c4819567b |
97290808809083 has 8 divisors (see below), whose sum is σ = 97588961049600. Its totient is φ = 96993059751720.
The previous prime is 97290808808971. The next prime is 97290808809269. The reversal of 97290808809083 is 38090880809279.
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 97290808809083 - 238 = 97015930902139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 97290808808998 and 97290808809016.
It is not an unprimeable number, because it can be changed into a prime (97290808809683) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100312433 + ... + 101277666.
It is an arithmetic number, because the mean of its divisors is an integer number (12198620131200).
Almost surely, 297290808809083 is an apocalyptic number.
97290808809083 is a deficient number, since it is larger than the sum of its proper divisors (298152240517).
97290808809083 is a wasteful number, since it uses less digits than its factorization.
97290808809083 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201591577.
The product of its (nonzero) digits is 125411328, while the sum is 71.
The spelling of 97290808809083 in words is "ninety-seven trillion, two hundred ninety billion, eight hundred eight million, eight hundred nine thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •