Base | Representation |
---|---|
bin | 1011011001110011010… |
… | …0010011000101100000 |
3 | 200201122220211220021210 |
4 | 2312130310103011200 |
5 | 11202203021434210 |
6 | 225555224550120 |
7 | 20103460431123 |
oct | 2663464230540 |
9 | 621586756253 |
10 | 195904483680 |
11 | 7609aa79174 |
12 | 31b74022340 |
13 | 15620996a39 |
14 | 96a61c63ba |
15 | 5168b32e20 |
hex | 2d9cd13160 |
195904483680 has 96 divisors (see below), whose sum is σ = 625790769408. Its totient is φ = 51505395200.
The previous prime is 195904483613. The next prime is 195904483717. The reversal of 195904483680 is 86384409591.
It is a tau number, because it is divible by the number of its divisors (96).
It is a self number, because there is not a number n which added to its sum of digits gives 195904483680.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2840106 + ... + 2908265.
It is an arithmetic number, because the mean of its divisors is an integer number (6518653848).
Almost surely, 2195904483680 is an apocalyptic number.
195904483680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
195904483680 is an abundant number, since it is smaller than the sum of its proper divisors (429886285728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195904483680 is a wasteful number, since it uses less digits than its factorization.
195904483680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5748460 (or 5748452 counting only the distinct ones).
The product of its (nonzero) digits is 7464960, while the sum is 57.
The spelling of 195904483680 in words is "one hundred ninety-five billion, nine hundred four million, four hundred eighty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •