Base | Representation |
---|---|
bin | 1000010010100011000111… |
… | …1000111010001100101101 |
3 | 1012021100210010111010200012 |
4 | 2010220301320322030231 |
5 | 2143314010421313031 |
6 | 31215132320143005 |
7 | 1630343122211600 |
oct | 204506170721455 |
9 | 35240703433605 |
10 | 9114757604141 |
11 | 29a4602056692 |
12 | 1032601a67a65 |
13 | 511696c38c77 |
14 | 237229ab0337 |
15 | 10c1682e9b2b |
hex | 84a31e3a32d |
9114757604141 has 6 divisors (see below), whose sum is σ = 10602881294670. Its totient is φ = 7812649374936.
The previous prime is 9114757604059. The next prime is 9114757604143. The reversal of 9114757604141 is 1414067574119.
It can be written as a sum of positive squares in only one way, i.e., 8150539657225 + 964217946916 = 2854915^2 + 981946^2 .
It is a de Polignac number, because none of the positive numbers 2k-9114757604141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 9114757604141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9114757604143) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 93007730606 + ... + 93007730703.
It is an arithmetic number, because the mean of its divisors is an integer number (1767146882445).
Almost surely, 29114757604141 is an apocalyptic number.
It is an amenable number.
9114757604141 is a deficient number, since it is larger than the sum of its proper divisors (1488123690529).
9114757604141 is a wasteful number, since it uses less digits than its factorization.
9114757604141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 186015461323 (or 186015461316 counting only the distinct ones).
The product of its (nonzero) digits is 846720, while the sum is 50.
The spelling of 9114757604141 in words is "nine trillion, one hundred fourteen billion, seven hundred fifty-seven million, six hundred four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •