Base | Representation |
---|---|
bin | 10110000111100100000100… |
… | …101000001111101101111001 |
3 | 110202102120101212220222201001 |
4 | 112013210010220033231321 |
5 | 100222240332214233410 |
6 | 542520201415125001 |
7 | 26330005405461022 |
oct | 2607440450175571 |
9 | 422376355828631 |
10 | 97276791946105 |
11 | 28aa4946064372 |
12 | aab0a88973761 |
13 | 423821523b695 |
14 | 1a04316a91c49 |
15 | b3a5d502e33a |
hex | 587904a0fb79 |
97276791946105 has 8 divisors (see below), whose sum is σ = 117100390559112. Its totient is φ = 77575940074368.
The previous prime is 97276791946079. The next prime is 97276791946153. The reversal of 97276791946105 is 50164919767279.
It can be written as a sum of positive squares in 4 ways, for example, as 1353043545616 + 95923748400489 = 1163204^2 + 9794067^2 .
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 97276791946105 - 215 = 97276791913337 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 30686683572 + ... + 30686686741.
It is an arithmetic number, because the mean of its divisors is an integer number (14637548819889).
Almost surely, 297276791946105 is an apocalyptic number.
It is an amenable number.
97276791946105 is a deficient number, since it is larger than the sum of its proper divisors (19823598613007).
97276791946105 is a wasteful number, since it uses less digits than its factorization.
97276791946105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61373370635.
The product of its (nonzero) digits is 360067680, while the sum is 73.
The spelling of 97276791946105 in words is "ninety-seven trillion, two hundred seventy-six billion, seven hundred ninety-one million, nine hundred forty-six thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •