Base | Representation |
---|---|
bin | 1000010100001000100100… |
… | …1111000101101110000111 |
3 | 1012100222002012101110202001 |
4 | 2011002021033011232013 |
5 | 2144240300131340241 |
6 | 31235435025530131 |
7 | 1632326050666030 |
oct | 205021117055607 |
9 | 35328065343661 |
10 | 9141992840071 |
11 | 2a05108699533 |
12 | 1037942aa3947 |
13 | 5141175900a0 |
14 | 238690c67a87 |
15 | 10cc0e349431 |
hex | 850893c5b87 |
9141992840071 has 16 divisors (see below), whose sum is σ = 11614641031168. Its totient is φ = 6999895260000.
The previous prime is 9141992840027. The next prime is 9141992840083. The reversal of 9141992840071 is 1700482991419.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9141992840071 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 9141992839994 and 9141992840021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9141996840071) 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 15 ways as a sum of consecutive naturals, for example, 1620343305 + ... + 1620348946.
It is an arithmetic number, because the mean of its divisors is an integer number (725915064448).
Almost surely, 29141992840071 is an apocalyptic number.
9141992840071 is a gapful number since it is divisible by the number (91) formed by its first and last digit.
9141992840071 is a deficient number, since it is larger than the sum of its proper divisors (2472648191097).
9141992840071 is a wasteful number, since it uses less digits than its factorization.
9141992840071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3240692302.
The product of its (nonzero) digits is 1306368, while the sum is 55.
The spelling of 9141992840071 in words is "nine trillion, one hundred forty-one billion, nine hundred ninety-two million, eight hundred forty thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •