Base | Representation |
---|---|
bin | 101101101101101101… |
… | …1000000001101010000 |
3 | 100101101200020122110110 |
4 | 1123123123000031100 |
5 | 3102023131211202 |
6 | 113033212001320 |
7 | 10043521034016 |
oct | 1333333001520 |
9 | 311350218413 |
10 | 98170569552 |
11 | 386a77aaa10 |
12 | 17039160240 |
13 | 93467b6a13 |
14 | 4a740c68b6 |
15 | 284881b26c |
hex | 16db6c0350 |
98170569552 has 40 divisors (see below), whose sum is σ = 276662515680. Its totient is φ = 29748657280.
The previous prime is 98170569551. The next prime is 98170569587. The reversal of 98170569552 is 25596507189.
It is a happy number.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 98170569492 and 98170569501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (98170569551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92964027 + ... + 92965082.
It is an arithmetic number, because the mean of its divisors is an integer number (6916562892).
Almost surely, 298170569552 is an apocalyptic number.
It is an amenable number.
98170569552 is an abundant number, since it is smaller than the sum of its proper divisors (178491946128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
98170569552 is a wasteful number, since it uses less digits than its factorization.
98170569552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185929131 (or 185929125 counting only the distinct ones).
The product of its (nonzero) digits is 6804000, while the sum is 57.
The spelling of 98170569552 in words is "ninety-eight billion, one hundred seventy million, five hundred sixty-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •