Base | Representation |
---|---|
bin | 11001111111001110100… |
… | …00011000100100100100 |
3 | 10011100211101111110122101 |
4 | 30333213100120210210 |
5 | 104112214120441431 |
6 | 1522113213341444 |
7 | 121340560203232 |
oct | 14774720304444 |
9 | 3140741443571 |
10 | 892938062116 |
11 | 3147692913a1 |
12 | 125083197884 |
13 | 662856a8139 |
14 | 3130b545952 |
15 | 1836257a961 |
hex | cfe7418924 |
892938062116 has 9 divisors (see below), whose sum is σ = 1562644916049. Its totient is φ = 446468086104.
The previous prime is 892938062113. The next prime is 892938062119. The reversal of 892938062116 is 611260839298.
The square root of 892938062116 is 944954.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (892938062113) and next prime (892938062119).
It can be written as a sum of positive squares in only one way, i.e., 317002780900 + 575935281216 = 563030^2 + 758904^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (892938062113) by changing a digit.
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 2 ways as a sum of consecutive naturals, for example, 1653670 + ... + 2126146.
Almost surely, 2892938062116 is an apocalyptic number.
892938062116 is the 944954-th square number.
It is an amenable number.
892938062116 is a deficient number, since it is larger than the sum of its proper divisors (669706853933).
892938062116 is an frugal number, since it uses more digits than its factorization.
892938062116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 944958 (or 472479 counting only the distinct ones).
The product of its (nonzero) digits is 2239488, while the sum is 55.
The spelling of 892938062116 in words is "eight hundred ninety-two billion, nine hundred thirty-eight million, sixty-two thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •