Base | Representation |
---|---|
bin | 10111001111011… |
… | …10111011111010 |
3 | 111120212021000220 |
4 | 23213232323322 |
5 | 344402341432 |
6 | 31202440510 |
7 | 4555114533 |
oct | 1347567372 |
9 | 446767026 |
10 | 194965242 |
11 | a00642aa |
12 | 55363136 |
13 | 31513764 |
14 | 1bc7168a |
15 | 121b272c |
hex | b9eeefa |
194965242 has 8 divisors (see below), whose sum is σ = 389930496. Its totient is φ = 64988412.
The previous prime is 194965241. The next prime is 194965279. The reversal of 194965242 is 242569491.
194965242 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
194965242 is an admirable number.
It is a super-2 number, since 2×1949652422 = 76022891176237128, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 194965194 and 194965203.
It is not an unprimeable number, because it can be changed into a prime (194965241) 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, 16247098 + ... + 16247109.
It is an arithmetic number, because the mean of its divisors is an integer number (48741312).
Almost surely, 2194965242 is an apocalyptic number.
194965242 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
194965242 is a wasteful number, since it uses less digits than its factorization.
194965242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32494212.
The product of its digits is 155520, while the sum is 42.
The square root of 194965242 is about 13962.9954522660. The cubic root of 194965242 is about 579.8545433896.
The spelling of 194965242 in words is "one hundred ninety-four million, nine hundred sixty-five thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •