Base | Representation |
---|---|
bin | 10111000010000… |
… | …10001100111011 |
3 | 111110120001010100 |
4 | 23201002030323 |
5 | 343430143042 |
6 | 31101050443 |
7 | 4534151655 |
oct | 1341021473 |
9 | 443501110 |
10 | 193209147 |
11 | 9a07498a |
12 | 54856a23 |
13 | 3104a351 |
14 | 1b9356d5 |
15 | 11e6724c |
hex | b84233b |
193209147 has 12 divisors (see below), whose sum is σ = 280753200. Its totient is φ = 128033808.
The previous prime is 193209139. The next prime is 193209167. The reversal of 193209147 is 741902391.
It is not a de Polignac number, because 193209147 - 23 = 193209139 is a prime.
It is not an unprimeable number, because it can be changed into a prime (193209167) 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 11 ways as a sum of consecutive naturals, for example, 62772 + ... + 65777.
It is an arithmetic number, because the mean of its divisors is an integer number (23396100).
Almost surely, 2193209147 is an apocalyptic number.
193209147 is a deficient number, since it is larger than the sum of its proper divisors (87544053).
193209147 is a wasteful number, since it uses less digits than its factorization.
193209147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128722 (or 128719 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 36.
The square root of 193209147 is about 13899.9693165129. The cubic root of 193209147 is about 578.1083306886.
The spelling of 193209147 in words is "one hundred ninety-three million, two hundred nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •