Base | Representation |
---|---|
bin | 10111010111000… |
… | …01000011100100 |
3 | 111122201122102100 |
4 | 23223201003210 |
5 | 400131110324 |
6 | 31240012100 |
7 | 4566415050 |
oct | 1353410344 |
9 | 448648370 |
10 | 195956964 |
11 | a0681405 |
12 | 55761030 |
13 | 3179cc88 |
14 | 1c04cc60 |
15 | 1230b4c9 |
hex | bae10e4 |
195956964 has 72 divisors (see below), whose sum is σ = 590728320. Its totient is φ = 53551872.
The previous prime is 195956963. The next prime is 195956989. The reversal of 195956964 is 469659591.
195956964 is a `hidden beast` number, since 19 + 5 + 9 + 569 + 64 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 195956964.
It is not an unprimeable number, because it can be changed into a prime (195956963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11109 + ... + 22700.
It is an arithmetic number, because the mean of its divisors is an integer number (8204560).
Almost surely, 2195956964 is an apocalyptic number.
195956964 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
195956964 is an abundant number, since it is smaller than the sum of its proper divisors (394771356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195956964 is a wasteful number, since it uses less digits than its factorization.
195956964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33849 (or 33844 counting only the distinct ones).
The product of its digits is 2624400, while the sum is 54.
The square root of 195956964 is about 13998.4629156204. The cubic root of 195956964 is about 580.8360554649.
The spelling of 195956964 in words is "one hundred ninety-five million, nine hundred fifty-six thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •