Base | Representation |
---|---|
bin | 101011001010101111… |
… | …0010101100010110001 |
3 | 22212021120022010122121 |
4 | 1112111132111202301 |
5 | 3004323212232321 |
6 | 110330423034241 |
7 | 6461146413313 |
oct | 1262536254261 |
9 | 285246263577 |
10 | 92702070961 |
11 | 363509a1a95 |
12 | 15b7189b981 |
13 | 8984882536 |
14 | 46b5b0d7b3 |
15 | 26286c0441 |
hex | 15957958b1 |
92702070961 has 4 divisors (see below), whose sum is σ = 94963097124. Its totient is φ = 90441044800.
The previous prime is 92702070953. The next prime is 92702070971. The reversal of 92702070961 is 16907020729.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16907020729 = 1300272.
It can be written as a sum of positive squares in 2 ways, for example, as 29427687025 + 63274383936 = 171545^2 + 251544^2 .
It is a cyclic number.
It is not a de Polignac number, because 92702070961 - 23 = 92702070953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (92702070911) 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 3 ways as a sum of consecutive naturals, for example, 1130513020 + ... + 1130513101.
It is an arithmetic number, because the mean of its divisors is an integer number (23740774281).
Almost surely, 292702070961 is an apocalyptic number.
It is an amenable number.
92702070961 is a deficient number, since it is larger than the sum of its proper divisors (2261026163).
92702070961 is a wasteful number, since it uses less digits than its factorization.
92702070961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2261026162.
The product of its (nonzero) digits is 95256, while the sum is 43.
The spelling of 92702070961 in words is "ninety-two billion, seven hundred two million, seventy thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •