Base | Representation |
---|---|
bin | 10110111001100… |
… | …10001001101110 |
3 | 111101110102120100 |
4 | 23130302021232 |
5 | 343134013310 |
6 | 31021131530 |
7 | 4521531144 |
oct | 1334621156 |
9 | 441412510 |
10 | 192094830 |
11 | 99483764 |
12 | 543b9ba6 |
13 | 30a4a0a5 |
14 | 1b725594 |
15 | 11ce6ec0 |
hex | b73226e |
192094830 has 48 divisors (see below), whose sum is σ = 502079760. Its totient is φ = 50955264.
The previous prime is 192094789. The next prime is 192094871. The reversal of 192094830 is 38490291.
It is an interprime number because it is at equal distance from previous prime (192094789) and next prime (192094871).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11841 + ... + 22899.
It is an arithmetic number, because the mean of its divisors is an integer number (10459995).
Almost surely, 2192094830 is an apocalyptic number.
192094830 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 192094830, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (251039880).
192094830 is an abundant number, since it is smaller than the sum of its proper divisors (309984930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
192094830 is a wasteful number, since it uses less digits than its factorization.
192094830 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11265 (or 11262 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 192094830 is about 13859.8279210097. The cubic root of 192094830 is about 576.9947906341.
The spelling of 192094830 in words is "one hundred ninety-two million, ninety-four thousand, eight hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •