Base | Representation |
---|---|
bin | 1011001100001011101… |
… | …0100110111110010000 |
3 | 200101020010212002121011 |
4 | 2303002322212332100 |
5 | 11122211132024122 |
6 | 224152352540304 |
7 | 16614050013025 |
oct | 2630272467620 |
9 | 611203762534 |
10 | 192248704912 |
11 | 74594422500 |
12 | 31313851694 |
13 | 1518a487134 |
14 | 943a87754c |
15 | 5002c04377 |
hex | 2cc2ea6f90 |
192248704912 has 240 divisors, whose sum is σ = 436378320000. Its totient is φ = 81817528320.
The previous prime is 192248704909. The next prime is 192248704927. The reversal of 192248704912 is 219407842291.
192248704912 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 550855714 + ... + 550856062.
It is an arithmetic number, because the mean of its divisors is an integer number (1818243000).
Almost surely, 2192248704912 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 192248704912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (218189160000).
192248704912 is an abundant number, since it is smaller than the sum of its proper divisors (244129615088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
192248704912 is a wasteful number, since it uses less digits than its factorization.
192248704912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630 (or 613 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 49.
The spelling of 192248704912 in words is "one hundred ninety-two billion, two hundred forty-eight million, seven hundred four thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •