Base | Representation |
---|---|
bin | 1011011101111010100… |
… | …1101000001101001000 |
3 | 200211111220011021022200 |
4 | 2313132221220031020 |
5 | 11211433244422411 |
6 | 230301002120200 |
7 | 20143031503260 |
oct | 2673651501510 |
9 | 624456137280 |
10 | 197008982856 |
11 | 76607486804 |
12 | 32221ab0060 |
13 | 1576876154a |
14 | 976cb767a0 |
15 | 51d0aa6e56 |
hex | 2ddea68348 |
197008982856 has 96 divisors (see below), whose sum is σ = 609961285440. Its totient is φ = 56272443264.
The previous prime is 197008982843. The next prime is 197008982893. The reversal of 197008982856 is 658289800791.
It is a happy number.
197008982856 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 197008982793 and 197008982802.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1800055 + ... + 1906361.
It is an arithmetic number, because the mean of its divisors is an integer number (6353763390).
Almost surely, 2197008982856 is an apocalyptic number.
It is an amenable number.
197008982856 is an abundant number, since it is smaller than the sum of its proper divisors (412952302584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
197008982856 is a wasteful number, since it uses less digits than its factorization.
197008982856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110003 (or 109996 counting only the distinct ones).
The product of its (nonzero) digits is 17418240, while the sum is 63.
The spelling of 197008982856 in words is "one hundred ninety-seven billion, eight million, nine hundred eighty-two thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •