Base | Representation |
---|---|
bin | 10111010110100… |
… | …11011110010011 |
3 | 111122121211002212 |
4 | 23223103132103 |
5 | 400122320311 |
6 | 31234502335 |
7 | 4566063623 |
oct | 1353233623 |
9 | 448554085 |
10 | 195901331 |
11 | a064362a |
12 | 557349ab |
13 | 31780862 |
14 | 1c036883 |
15 | 122e9c8b |
hex | bad3793 |
195901331 has 8 divisors (see below), whose sum is σ = 199284624. Its totient is φ = 192542560.
The previous prime is 195901301. The next prime is 195901361. The reversal of 195901331 is 133109591.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (195901301) and next prime (195901361).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 195901331 - 214 = 195884947 is a prime.
It is a super-2 number, since 2×1959013312 = 76754662975143122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (195901301) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 10361 + ... + 22341.
It is an arithmetic number, because the mean of its divisors is an integer number (24910578).
Almost surely, 2195901331 is an apocalyptic number.
195901331 is a deficient number, since it is larger than the sum of its proper divisors (3383293).
195901331 is a wasteful number, since it uses less digits than its factorization.
195901331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12261.
The product of its (nonzero) digits is 3645, while the sum is 32.
The square root of 195901331 is about 13996.4756635376. The cubic root of 195901331 is about 580.7810830021.
The spelling of 195901331 in words is "one hundred ninety-five million, nine hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •