Base | Representation |
---|---|
bin | 10111001001110… |
… | …11011011111101 |
3 | 111112110220111012 |
4 | 23210323123331 |
5 | 344210330023 |
6 | 31135005005 |
7 | 4545633155 |
oct | 1344733375 |
9 | 445426435 |
10 | 194230013 |
11 | 9a70197a |
12 | 55069765 |
13 | 31316c03 |
14 | 1bb1d765 |
15 | 120b9978 |
hex | b93b6fd |
194230013 has 4 divisors (see below), whose sum is σ = 194270460. Its totient is φ = 194189568.
The previous prime is 194230007. The next prime is 194230033. The reversal of 194230013 is 310032491.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 91450969 + 102779044 = 9563^2 + 10138^2 .
It is a cyclic number.
It is not a de Polignac number, because 194230013 - 210 = 194228989 is a prime.
It is a super-3 number, since 3×1942300133 (a number of 26 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (194230033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11870 + ... + 23007.
It is an arithmetic number, because the mean of its divisors is an integer number (48567615).
Almost surely, 2194230013 is an apocalyptic number.
It is an amenable number.
194230013 is a deficient number, since it is larger than the sum of its proper divisors (40447).
194230013 is an equidigital number, since it uses as much as digits as its factorization.
194230013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40446.
The product of its (nonzero) digits is 648, while the sum is 23.
The square root of 194230013 is about 13936.6428166901. The cubic root of 194230013 is about 579.1247331255.
The spelling of 194230013 in words is "one hundred ninety-four million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •