Base | Representation |
---|---|
bin | 10111001000001… |
… | …01000110001001 |
3 | 111112001121011111 |
4 | 23210011012021 |
5 | 344131214213 |
6 | 31130130321 |
7 | 4544015224 |
oct | 1344050611 |
9 | 445047144 |
10 | 194007433 |
11 | 9a56a724 |
12 | 54b809a1 |
13 | 312697c9 |
14 | 1baa25bb |
15 | 12073a3d |
hex | b905189 |
194007433 has 4 divisors (see below), whose sum is σ = 194069008. Its totient is φ = 193945860.
The previous prime is 194007431. The next prime is 194007439. The reversal of 194007433 is 334700491.
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: 334700491 = 5227 ⋅64033.
It is a cyclic number.
It is not a de Polignac number, because 194007433 - 21 = 194007431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 194007395 and 194007404.
It is not an unprimeable number, because it can be changed into a prime (194007431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25791 + ... + 32452.
It is an arithmetic number, because the mean of its divisors is an integer number (48517252).
Almost surely, 2194007433 is an apocalyptic number.
It is an amenable number.
194007433 is a deficient number, since it is larger than the sum of its proper divisors (61575).
194007433 is an equidigital number, since it uses as much as digits as its factorization.
194007433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61574.
The product of its (nonzero) digits is 9072, while the sum is 31.
The square root of 194007433 is about 13928.6551037780. The cubic root of 194007433 is about 578.9034304696.
The spelling of 194007433 in words is "one hundred ninety-four million, seven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •