Base | Representation |
---|---|
bin | 1011011011111110111… |
… | …1100001010000010000 |
3 | 200210011202102020101220 |
4 | 2312333233201100100 |
5 | 11204403022333202 |
6 | 230133315525040 |
7 | 20124134061600 |
oct | 2667757412020 |
9 | 623152366356 |
10 | 196490433552 |
11 | 763707aaa66 |
12 | 320b82b9780 |
13 | 156b51b343a |
14 | 971dd52c00 |
15 | 51a02c7abc |
hex | 2dbfbe1410 |
196490433552 has 120 divisors (see below), whose sum is σ = 595891771200. Its totient is φ = 55625004288.
The previous prime is 196490433533. The next prime is 196490433577. The reversal of 196490433552 is 255334094691.
It is a junction number, because it is equal to n+sod(n) for n = 196490433495 and 196490433504.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 126852 + ... + 639587.
It is an arithmetic number, because the mean of its divisors is an integer number (4965764760).
Almost surely, 2196490433552 is an apocalyptic number.
196490433552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 196490433552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (297945885600).
196490433552 is an abundant number, since it is smaller than the sum of its proper divisors (399401337648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196490433552 is a wasteful number, since it uses less digits than its factorization.
196490433552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 766573 (or 766560 counting only the distinct ones).
The product of its (nonzero) digits is 3499200, while the sum is 51.
The spelling of 196490433552 in words is "one hundred ninety-six billion, four hundred ninety million, four hundred thirty-three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •