Base | Representation |
---|---|
bin | 11100010000101010000… |
… | …01000001110100011111 |
3 | 10102211100201102000202002 |
4 | 32020111001001310133 |
5 | 111402114342400111 |
6 | 2022024521352515 |
7 | 130103443006022 |
oct | 16102501016437 |
9 | 3384321360662 |
10 | 971015200031 |
11 | 344894847758 |
12 | 13823303873b |
13 | 70749333326 |
14 | 34dd6b851b9 |
15 | 1a3d1d2263b |
hex | e215041d1f |
971015200031 has 4 divisors (see below), whose sum is σ = 991675097952. Its totient is φ = 950355302112.
The previous prime is 971015200003. The next prime is 971015200159. The reversal of 971015200031 is 130002510179.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 971015200031 - 226 = 970948091167 is a prime.
It is a super-2 number, since 2×9710152000312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 971015199967 and 971015200003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (971015220031) 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 3 ways as a sum of consecutive naturals, for example, 10329948890 + ... + 10329948983.
It is an arithmetic number, because the mean of its divisors is an integer number (247918774488).
Almost surely, 2971015200031 is an apocalyptic number.
971015200031 is a deficient number, since it is larger than the sum of its proper divisors (20659897921).
971015200031 is a wasteful number, since it uses less digits than its factorization.
971015200031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20659897920.
The product of its (nonzero) digits is 1890, while the sum is 29.
The spelling of 971015200031 in words is "nine hundred seventy-one billion, fifteen million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •