Base | Representation |
---|---|
bin | 1011011100110001011… |
… | …0110100010000000000 |
3 | 200210201111122001110120 |
4 | 2313030112310100000 |
5 | 11210321211432233 |
6 | 230210315500240 |
7 | 20132313636105 |
oct | 2671426642000 |
9 | 623644561416 |
10 | 196702061568 |
11 | 7646a205251 |
12 | 32157157680 |
13 | 15719cac30c |
14 | 97400c0aac |
15 | 51b3b7c4b3 |
hex | 2dcc5b4400 |
196702061568 has 176 divisors, whose sum is σ = 560326849344. Its totient is φ = 61131980800.
The previous prime is 196702061531. The next prime is 196702061587. The reversal of 196702061568 is 865160207691.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 196702061568.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5570368 + ... + 5605568.
Almost surely, 2196702061568 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 196702061568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (280163424672).
196702061568 is an abundant number, since it is smaller than the sum of its proper divisors (363624787776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196702061568 is a wasteful number, since it uses less digits than its factorization.
196702061568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35348 (or 35330 counting only the distinct ones).
The product of its (nonzero) digits is 1088640, while the sum is 51.
The spelling of 196702061568 in words is "one hundred ninety-six billion, seven hundred two million, sixty-one thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •