Base | Representation |
---|---|
bin | 10111010110100… |
… | …11101001110110 |
3 | 111122121212010020 |
4 | 23223103221312 |
5 | 400122331240 |
6 | 31234510010 |
7 | 4566066030 |
oct | 1353235166 |
9 | 448555106 |
10 | 195902070 |
11 | a0644141 |
12 | 55735306 |
13 | 31780cb0 |
14 | 1c036c50 |
15 | 122ea0d0 |
hex | bad3a76 |
195902070 has 128 divisors (see below), whose sum is σ = 587188224. Its totient is φ = 40725504.
The previous prime is 195902053. The next prime is 195902089. The reversal of 195902070 is 70209591.
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 63 ways as a sum of consecutive naturals, for example, 198799 + ... + 199781.
It is an arithmetic number, because the mean of its divisors is an integer number (4587408).
Almost surely, 2195902070 is an apocalyptic number.
195902070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 195902070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (293594112).
195902070 is an abundant number, since it is smaller than the sum of its proper divisors (391286154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195902070 is a wasteful number, since it uses less digits than its factorization.
195902070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1086.
The product of its (nonzero) digits is 5670, while the sum is 33.
The square root of 195902070 is about 13996.5020630156. The cubic root of 195902070 is about 580.7818132961.
The spelling of 195902070 in words is "one hundred ninety-five million, nine hundred two thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •