Base | Representation |
---|---|
bin | 10111010011000… |
… | …00100001010001 |
3 | 111121201220012222 |
4 | 23221200201101 |
5 | 400012233411 |
6 | 31220430425 |
7 | 4562063111 |
oct | 1351404121 |
9 | 447656188 |
10 | 195430481 |
11 | a03518a4 |
12 | 55548415 |
13 | 3164744c |
14 | 1bd53041 |
15 | 122554db |
hex | ba60851 |
195430481 has 4 divisors (see below), whose sum is σ = 195493812. Its totient is φ = 195367152.
The previous prime is 195430439. The next prime is 195430483. The reversal of 195430481 is 184034591.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 153388225 + 42042256 = 12385^2 + 6484^2 .
It is a cyclic number.
It is not a de Polignac number, because 195430481 - 210 = 195429457 is a prime.
It is a super-2 number, since 2×1954304812 = 76386145807782722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (195430483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26786 + ... + 33291.
It is an arithmetic number, because the mean of its divisors is an integer number (48873453).
Almost surely, 2195430481 is an apocalyptic number.
It is an amenable number.
195430481 is a deficient number, since it is larger than the sum of its proper divisors (63331).
195430481 is an equidigital number, since it uses as much as digits as its factorization.
195430481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63330.
The product of its (nonzero) digits is 17280, while the sum is 35.
The square root of 195430481 is about 13979.6452387033. The cubic root of 195430481 is about 580.3154061352.
The spelling of 195430481 in words is "one hundred ninety-five million, four hundred thirty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •