Base | Representation |
---|---|
bin | 1011011101111001101… |
… | …0100110011001011101 |
3 | 200211111121202010020221 |
4 | 2313132122212121131 |
5 | 11211431242341133 |
6 | 230300341441341 |
7 | 20142653144542 |
oct | 2673632463135 |
9 | 624447663227 |
10 | 197005043293 |
11 | 76605235973 |
12 | 32220710251 |
13 | 157679b2346 |
14 | 976c42cbc9 |
15 | 51d0579a2d |
hex | 2dde6a665d |
197005043293 has 4 divisors (see below), whose sum is σ = 197064403360. Its totient is φ = 196945683228.
The previous prime is 197005043267. The next prime is 197005043297. The reversal of 197005043293 is 392340500791.
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, and also an emirpimes, since its reverse is a distinct semiprime: 392340500791 = 325891 ⋅1203901.
It is a cyclic number.
It is not a de Polignac number, because 197005043293 - 233 = 188415108701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (197005043297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29675055 + ... + 29681692.
It is an arithmetic number, because the mean of its divisors is an integer number (49266100840).
Almost surely, 2197005043293 is an apocalyptic number.
It is an amenable number.
197005043293 is a deficient number, since it is larger than the sum of its proper divisors (59360067).
197005043293 is an equidigital number, since it uses as much as digits as its factorization.
197005043293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59360066.
The product of its (nonzero) digits is 204120, while the sum is 43.
The spelling of 197005043293 in words is "one hundred ninety-seven billion, five million, forty-three thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •