Base | Representation |
---|---|
bin | 1000101000011101111111… |
… | …0111100101110111111001 |
3 | 1020121100210201011022210002 |
4 | 2022013133313211313321 |
5 | 2221001230143232311 |
6 | 32104132155002345 |
7 | 1666504135243652 |
oct | 212073767456771 |
9 | 36540721138702 |
10 | 9491338649081 |
11 | 302a288257473 |
12 | 109359a1393b5 |
13 | 53b04c76ac43 |
14 | 24b551888529 |
15 | 116d58c2893b |
hex | 8a1dfde5df9 |
9491338649081 has 8 divisors (see below), whose sum is σ = 9582749932704. Its totient is φ = 9400057490880.
The previous prime is 9491338649063. The next prime is 9491338649129. The reversal of 9491338649081 is 1809468331949.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-9491338649081 is a prime.
It is a super-2 number, since 2×94913386490812 (a number of 27 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 = 9491338648999 and 9491338649017.
It is not an unprimeable number, because it can be changed into a prime (9491838649081) 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, 32384771 + ... + 32676536.
It is an arithmetic number, because the mean of its divisors is an integer number (1197843741588).
Almost surely, 29491338649081 is an apocalyptic number.
It is an amenable number.
9491338649081 is a deficient number, since it is larger than the sum of its proper divisors (91411283623).
9491338649081 is a wasteful number, since it uses less digits than its factorization.
9491338649081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65062711.
The product of its (nonzero) digits is 40310784, while the sum is 65.
The spelling of 9491338649081 in words is "nine trillion, four hundred ninety-one billion, three hundred thirty-eight million, six hundred forty-nine thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •