Base | Representation |
---|---|
bin | 10111010100110… |
… | …11001111000100 |
3 | 111122012010010100 |
4 | 23222123033010 |
5 | 400042432410 |
6 | 31225524100 |
7 | 4564114221 |
oct | 1352331704 |
9 | 448163110 |
10 | 195670980 |
11 | a04a655a |
12 | 55643630 |
13 | 316cca5b |
14 | 1bdb6948 |
15 | 122a18c0 |
hex | ba9b3c4 |
195670980 has 36 divisors (see below), whose sum is σ = 593535852. Its totient is φ = 52178880.
The previous prime is 195670961. The next prime is 195670991. The reversal of 195670980 is 89076591.
195670980 is a `hidden beast` number, since 1 + 9 + 567 + 0 + 9 + 80 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 38118276 + 157552704 = 6174^2 + 12552^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 543351 + ... + 543710.
It is an arithmetic number, because the mean of its divisors is an integer number (16487107).
Almost surely, 2195670980 is an apocalyptic number.
195670980 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
195670980 is an abundant number, since it is smaller than the sum of its proper divisors (397864872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
195670980 is a wasteful number, since it uses less digits than its factorization.
195670980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1087076 (or 1087071 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 45.
The square root of 195670980 is about 13988.2443501678. The cubic root of 195670980 is about 580.5533561606.
The spelling of 195670980 in words is "one hundred ninety-five million, six hundred seventy thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •