Base | Representation |
---|---|
bin | 10001011110000… |
… | …010001110000001 |
3 | 202102111022112001 |
4 | 101132002032001 |
5 | 1100012223311 |
6 | 45025504001 |
7 | 10156122241 |
oct | 2136021601 |
9 | 672438461 |
10 | 293086081 |
11 | 140491a02 |
12 | 821a2001 |
13 | 48949b22 |
14 | 2acd3b21 |
15 | 1aae54c1 |
hex | 11782381 |
293086081 has 8 divisors (see below), whose sum is σ = 300462624. Its totient is φ = 285720480.
The previous prime is 293086063. The next prime is 293086109. The reversal of 293086081 is 180680392.
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-293086081 is a prime.
It is a super-2 number, since 2×2930860812 = 171798901751877122, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 293086081.
It is not an unprimeable number, because it can be changed into a prime (293086051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 90370 + ... + 93556.
It is an arithmetic number, because the mean of its divisors is an integer number (37557828).
Almost surely, 2293086081 is an apocalyptic number.
It is an amenable number.
293086081 is a deficient number, since it is larger than the sum of its proper divisors (7376543).
293086081 is a wasteful number, since it uses less digits than its factorization.
293086081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5471.
The product of its (nonzero) digits is 20736, while the sum is 37.
The square root of 293086081 is about 17119.7570368274. The cubic root of 293086081 is about 664.2502572247.
The spelling of 293086081 in words is "two hundred ninety-three million, eighty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •