Base | Representation |
---|---|
bin | 1101110011001110101100000… |
… | …0110111000111001000110001 |
3 | 11201100110021022221210101202101 |
4 | 3130303223000313013020301 |
5 | 2004241322013420231001 |
6 | 13321222513554020401 |
7 | 411360120301610206 |
oct | 33463530067071061 |
9 | 4640407287711671 |
10 | 971121111102001 |
11 | 26147a172161a12 |
12 | 90b0193b277701 |
13 | 328b4435338322 |
14 | 131b47266a7cad |
15 | 774114e569a01 |
hex | 3733ac0dc7231 |
971121111102001 has 8 divisors (see below), whose sum is σ = 978907738886144. Its totient is φ = 963336670894080.
The previous prime is 971121111101929. The next prime is 971121111102013. The reversal of 971121111102001 is 100201111121179.
971121111102001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 971121111102001 - 239 = 970571355288113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (971121111102031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 546002640 + ... + 547778353.
It is an arithmetic number, because the mean of its divisors is an integer number (122363467360768).
Almost surely, 2971121111102001 is an apocalyptic number.
It is an amenable number.
971121111102001 is a deficient number, since it is larger than the sum of its proper divisors (7786627784143).
971121111102001 is a wasteful number, since it uses less digits than its factorization.
971121111102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1093788111.
The product of its (nonzero) digits is 252, while the sum is 28.
The spelling of 971121111102001 in words is "nine hundred seventy-one trillion, one hundred twenty-one billion, one hundred eleven million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.198 sec. • engine limits •