Base | Representation |
---|---|
bin | 10111001000100… |
… | …11001010001110 |
3 | 111112011112012000 |
4 | 23210103022032 |
5 | 344140040123 |
6 | 31131253130 |
7 | 4544345166 |
oct | 1344231216 |
9 | 445145160 |
10 | 194065038 |
11 | 9a5a9a32 |
12 | 54baa1a6 |
13 | 31289aab |
14 | 1bab95a6 |
15 | 12085b43 |
hex | b91328e |
194065038 has 16 divisors (see below), whose sum is σ = 431255760. Its totient is φ = 64688328.
The previous prime is 194065033. The next prime is 194065057. The reversal of 194065038 is 830560491.
It is a super-2 number, since 2×1940650382 = 75322477947882888, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 194064993 and 194065011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (194065033) 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 7 ways as a sum of consecutive naturals, for example, 1796845 + ... + 1796952.
It is an arithmetic number, because the mean of its divisors is an integer number (26953485).
Almost surely, 2194065038 is an apocalyptic number.
194065038 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
194065038 is an abundant number, since it is smaller than the sum of its proper divisors (237190722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
194065038 is a wasteful number, since it uses less digits than its factorization.
194065038 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3593808 (or 3593802 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
The square root of 194065038 is about 13930.7228096750. The cubic root of 194065038 is about 578.9607211132.
The spelling of 194065038 in words is "one hundred ninety-four million, sixty-five thousand, thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •