Base | Representation |
---|---|
bin | 1011011101000000111… |
… | …1010010001000000000 |
3 | 200210220001012012121220 |
4 | 2313100033102020000 |
5 | 11210434400230043 |
6 | 230221003515040 |
7 | 20134034365302 |
oct | 2672017221000 |
9 | 623801165556 |
10 | 196767195648 |
11 | 764a2a52471 |
12 | 32174b28a80 |
13 | 1572a6360aa |
14 | 97489d7972 |
15 | 51b9746483 |
hex | 2dd03d2200 |
196767195648 has 240 divisors, whose sum is σ = 571544207520. Its totient is φ = 59986870272.
The previous prime is 196767195643. The next prime is 196767195673. The reversal of 196767195648 is 846591767691.
It is a Smith number, since the sum of its digits (69) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (196767195643) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24539736 + ... + 24547752.
It is an arithmetic number, because the mean of its divisors is an integer number (2381434198).
Almost surely, 2196767195648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 196767195648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (285772103760).
196767195648 is an abundant number, since it is smaller than the sum of its proper divisors (374777011872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196767195648 is an equidigital number, since it uses as much as digits as its factorization.
196767195648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8115 (or 8070 counting only the distinct ones).
The product of its digits is 137168640, while the sum is 69.
The spelling of 196767195648 in words is "one hundred ninety-six billion, seven hundred sixty-seven million, one hundred ninety-five thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •