Base | Representation |
---|---|
bin | 10111000001100… |
… | …10001110001101 |
3 | 111110102201100010 |
4 | 23200302032031 |
5 | 343421044233 |
6 | 31055423433 |
7 | 4533460101 |
oct | 1340621615 |
9 | 443381303 |
10 | 193143693 |
11 | 9a02a796 |
12 | 54824b79 |
13 | 31026612 |
14 | 1b919901 |
15 | 11e52b63 |
hex | b83238d |
193143693 has 4 divisors (see below), whose sum is σ = 257524928. Its totient is φ = 128762460.
The previous prime is 193143679. The next prime is 193143701. The reversal of 193143693 is 396341391.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 193143693 - 24 = 193143677 is a prime.
It is a super-2 number, since 2×1931436932 = 74608972291356498, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (193143193) 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 3 ways as a sum of consecutive naturals, for example, 32190613 + ... + 32190618.
It is an arithmetic number, because the mean of its divisors is an integer number (64381232).
Almost surely, 2193143693 is an apocalyptic number.
It is an amenable number.
193143693 is a deficient number, since it is larger than the sum of its proper divisors (64381235).
193143693 is an equidigital number, since it uses as much as digits as its factorization.
193143693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64381234.
The product of its digits is 52488, while the sum is 39.
The square root of 193143693 is about 13897.6146514429. The cubic root of 193143693 is about 578.0430408596.
The spelling of 193143693 in words is "one hundred ninety-three million, one hundred forty-three thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •