Base | Representation |
---|---|
bin | 1011010110011000101… |
… | …0000011001000000000 |
3 | 200122022000021011220220 |
4 | 2311212022003020000 |
5 | 11143313241013332 |
6 | 225324225303040 |
7 | 20041653611232 |
oct | 2654612031000 |
9 | 618260234826 |
10 | 194987438592 |
11 | 7576a364671 |
12 | 31958a94a80 |
13 | 155059b2bcb |
14 | 961a4b0252 |
15 | 511338ad2c |
hex | 2d66283200 |
194987438592 has 320 divisors, whose sum is σ = 559314201600. Its totient is φ = 60181954560.
The previous prime is 194987438587. The next prime is 194987438623. The reversal of 194987438592 is 295834789491.
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 31 ways as a sum of consecutive naturals, for example, 288016558 + ... + 288017234.
It is an arithmetic number, because the mean of its divisors is an integer number (1747856880).
Almost surely, 2194987438592 is an apocalyptic number.
194987438592 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 194987438592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (279657100800).
194987438592 is an abundant number, since it is smaller than the sum of its proper divisors (364326763008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
194987438592 is a wasteful number, since it uses less digits than its factorization.
194987438592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 927 (or 911 counting only the distinct ones).
The product of its digits is 156764160, while the sum is 69.
The spelling of 194987438592 in words is "one hundred ninety-four billion, nine hundred eighty-seven million, four hundred thirty-eight thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •