Base | Representation |
---|---|
bin | 10111010001110… |
… | …01110111010011 |
3 | 111121102212000202 |
4 | 23220321313103 |
5 | 344442202042 |
6 | 31213205415 |
7 | 4560533360 |
oct | 1350716723 |
9 | 447385022 |
10 | 195272147 |
11 | a0253944 |
12 | 5549086b |
13 | 315c0365 |
14 | 1bd11467 |
15 | 12223632 |
hex | ba39dd3 |
195272147 has 8 divisors (see below), whose sum is σ = 223296096. Its totient is φ = 167280192.
The previous prime is 195272117. The next prime is 195272171. The reversal of 195272147 is 741272591.
It is a happy number.
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 195272147 - 28 = 195271891 is a prime.
It is a super-2 number, since 2×1952721472 = 76262422787979218, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 195272147.
It is not an unprimeable number, because it can be changed into a prime (195272117) 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, 6953 + ... + 20949.
It is an arithmetic number, because the mean of its divisors is an integer number (27912012).
Almost surely, 2195272147 is an apocalyptic number.
195272147 is a deficient number, since it is larger than the sum of its proper divisors (28023949).
195272147 is a wasteful number, since it uses less digits than its factorization.
195272147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15997.
The product of its digits is 35280, while the sum is 38.
The square root of 195272147 is about 13973.9810719780. The cubic root of 195272147 is about 580.1586436821.
The spelling of 195272147 in words is "one hundred ninety-five million, two hundred seventy-two thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •