Base | Representation |
---|---|
bin | 1011001101001000000… |
… | …1001000001101001000 |
3 | 200101212210121111002102 |
4 | 2303102001020031020 |
5 | 11123221012302021 |
6 | 224233443252532 |
7 | 16623244421003 |
oct | 2632201101510 |
9 | 611783544072 |
10 | 192502072136 |
11 | 74704446000 |
12 | 3138467a148 |
13 | 151cab0837a |
14 | 946238c53a |
15 | 501a0a100b |
hex | 2cd2048348 |
192502072136 has 64 divisors (see below), whose sum is σ = 399540591360. Its totient is φ = 86942856000.
The previous prime is 192502072111. The next prime is 192502072141. The reversal of 192502072136 is 631270205291.
It is a self number, because there is not a number n which added to its sum of digits gives 192502072136.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1614161 + ... + 1729311.
It is an arithmetic number, because the mean of its divisors is an integer number (6242821740).
Almost surely, 2192502072136 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 192502072136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (199770295680).
192502072136 is an abundant number, since it is smaller than the sum of its proper divisors (207038519224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
192502072136 is a wasteful number, since it uses less digits than its factorization.
192502072136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115347 (or 115321 counting only the distinct ones).
The product of its (nonzero) digits is 45360, while the sum is 38.
The spelling of 192502072136 in words is "one hundred ninety-two billion, five hundred two million, seventy-two thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •