Base | Representation |
---|---|
bin | 1000010011111100010011… |
… | …0001101101001110111101 |
3 | 1012100122120111022110020122 |
4 | 2010333010301231032331 |
5 | 2144212022340201021 |
6 | 31234132004224325 |
7 | 1632151266101204 |
oct | 204770461551675 |
9 | 35318514273218 |
10 | 9138696803261 |
11 | 2a03777111273 |
12 | 103718309b0a5 |
13 | 513a1076794c |
14 | 23845b20023b |
15 | 10cab9ccabab |
hex | 84fc4c6d3bd |
9138696803261 has 4 divisors (see below), whose sum is σ = 9140297001024. Its totient is φ = 9137096605500.
The previous prime is 9138696803233. The next prime is 9138696803351. The reversal of 9138696803261 is 1623086968319.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9138696803261 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 9138696803194 and 9138696803203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9138696803161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 800090315 + ... + 800101736.
It is an arithmetic number, because the mean of its divisors is an integer number (2285074250256).
Almost surely, 29138696803261 is an apocalyptic number.
It is an amenable number.
9138696803261 is a deficient number, since it is larger than the sum of its proper divisors (1600197763).
9138696803261 is a wasteful number, since it uses less digits than its factorization.
9138696803261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1600197762.
The product of its (nonzero) digits is 20155392, while the sum is 62.
The spelling of 9138696803261 in words is "nine trillion, one hundred thirty-eight billion, six hundred ninety-six million, eight hundred three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •