Base | Representation |
---|---|
bin | 10110000101110011001000… |
… | …110100110001100001100001 |
3 | 110201222222101220021010122001 |
4 | 112011303020310301201201 |
5 | 100213244011023404212 |
6 | 542344344544244001 |
7 | 26315153410010551 |
oct | 2605631064614141 |
9 | 421888356233561 |
10 | 97155529513057 |
11 | 28a58479630654 |
12 | aa91486310601 |
13 | 422995b640612 |
14 | 19dc4d1c07161 |
15 | b37389309657 |
hex | 585cc8d31861 |
97155529513057 has 4 divisors (see below), whose sum is σ = 97155555385536. Its totient is φ = 97155503640580.
The previous prime is 97155529512973. The next prime is 97155529513067. The reversal of 97155529513057 is 75031592555179.
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.
It is a cyclic number.
It is not a de Polignac number, because 97155529513057 - 231 = 97153382029409 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 97155529513057.
It is not an unprimeable number, because it can be changed into a prime (97155529513067) 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, 6098869 + ... + 15215362.
It is an arithmetic number, because the mean of its divisors is an integer number (24288888846384).
Almost surely, 297155529513057 is an apocalyptic number.
It is an amenable number.
97155529513057 is a deficient number, since it is larger than the sum of its proper divisors (25872479).
97155529513057 is a wasteful number, since it uses less digits than its factorization.
97155529513057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25872478.
The product of its (nonzero) digits is 74418750, while the sum is 64.
The spelling of 97155529513057 in words is "ninety-seven trillion, one hundred fifty-five billion, five hundred twenty-nine million, five hundred thirteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •