Base | Representation |
---|---|
bin | 1011001011110001001… |
… | …1110100001001010000 |
3 | 200100221102022012100201 |
4 | 2302330103310021100 |
5 | 11121444243400302 |
6 | 224133353224544 |
7 | 16611232651615 |
oct | 2627423641120 |
9 | 610842265321 |
10 | 192137871952 |
11 | 74537902014 |
12 | 312a2702154 |
13 | 1517051c8c0 |
14 | 9429c6650c |
15 | 4ee810ec87 |
hex | 2cbc4f4250 |
192137871952 has 40 divisors (see below), whose sum is σ = 400930449920. Its totient is φ = 88672959360.
The previous prime is 192137871943. The next prime is 192137871953. The reversal of 192137871952 is 259178731291.
It is a super-3 number, since 3×1921378719523 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 192137871893 and 192137871902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (192137871953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4778749 + ... + 4818787.
It is an arithmetic number, because the mean of its divisors is an integer number (10023261248).
Almost surely, 2192137871952 is an apocalyptic number.
It is an amenable number.
192137871952 is an abundant number, since it is smaller than the sum of its proper divisors (208792577968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
192137871952 is a wasteful number, since it uses less digits than its factorization.
192137871952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63131 (or 63125 counting only the distinct ones).
The product of its digits is 1905120, while the sum is 55.
The spelling of 192137871952 in words is "one hundred ninety-two billion, one hundred thirty-seven million, eight hundred seventy-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •