Base | Representation |
---|---|
bin | 10111010001100… |
… | …11100011010101 |
3 | 111121101112120012 |
4 | 23220303203111 |
5 | 344440340133 |
6 | 31212450005 |
7 | 4560365114 |
oct | 1350634325 |
9 | 447345505 |
10 | 195246293 |
11 | a0236480 |
12 | 55479905 |
13 | 315b1668 |
14 | 1bd05c7b |
15 | 1221ab48 |
hex | ba338d5 |
195246293 has 4 divisors (see below), whose sum is σ = 212995968. Its totient is φ = 177496620.
The previous prime is 195246257. The next prime is 195246301. The reversal of 195246293 is 392642591.
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 a cyclic number.
It is not a de Polignac number, because 195246293 - 26 = 195246229 is a prime.
It is a super-2 number, since 2×1952462932 = 76242229860483698, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 195246293.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195246253) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8874821 + ... + 8874842.
It is an arithmetic number, because the mean of its divisors is an integer number (53248992).
Almost surely, 2195246293 is an apocalyptic number.
It is an amenable number.
195246293 is a deficient number, since it is larger than the sum of its proper divisors (17749675).
195246293 is a wasteful number, since it uses less digits than its factorization.
195246293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17749674.
The product of its digits is 116640, while the sum is 41.
The square root of 195246293 is about 13973.0559649634. The cubic root of 195246293 is about 580.1330382492.
The spelling of 195246293 in words is "one hundred ninety-five million, two hundred forty-six thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •