Base | Representation |
---|---|
bin | 101100110011011100010101… |
… | …001101000110001011110000 |
3 | 221211200201022210012012012020 |
4 | 230303130111031012023300 |
5 | 201311423140020443140 |
6 | 1535031045022231440 |
7 | 56335221613045545 |
oct | 5463342515061360 |
9 | 854621283165166 |
10 | 197049160327920 |
11 | 57871096a4265a |
12 | 1a125545125580 |
13 | 85c486b568614 |
14 | 3693331b26bcc |
15 | 17baa7a62d6d0 |
hex | b337153462f0 |
197049160327920 has 80 divisors (see below), whose sum is σ = 611802401223552. Its totient is φ = 52464721962240.
The previous prime is 197049160327919. The next prime is 197049160328039. The reversal of 197049160327920 is 29723061940791.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent 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 15 ways as a sum of consecutive naturals, for example, 638289046 + ... + 638597685.
Almost surely, 2197049160327920 is an apocalyptic number.
197049160327920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
197049160327920 is an abundant number, since it is smaller than the sum of its proper divisors (414753240895632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
197049160327920 is a wasteful number, since it uses less digits than its factorization.
197049160327920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1276887390 (or 1276887384 counting only the distinct ones).
The product of its (nonzero) digits is 10287648, while the sum is 60.
The spelling of 197049160327920 in words is "one hundred ninety-seven trillion, forty-nine billion, one hundred sixty million, three hundred twenty-seven thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •