Base | Representation |
---|---|
bin | 11110100110110100… |
… | …001111110100111001 |
3 | 10010211022110000200001 |
4 | 132212310033310321 |
5 | 1014301023011431 |
6 | 23033002313001 |
7 | 2242250005216 |
oct | 364664176471 |
9 | 103738400601 |
10 | 32863485241 |
11 | 12a34642964 |
12 | 6451ab8761 |
13 | 31396bc772 |
14 | 183a876b0d |
15 | cc5203e61 |
hex | 7a6d0fd39 |
32863485241 has 8 divisors (see below), whose sum is σ = 34077859200. Its totient is φ = 31654521360.
The previous prime is 32863485229. The next prime is 32863485251. The reversal of 32863485241 is 14258436823.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 32863485241 - 223 = 32855096633 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32863485191 and 32863485200.
It is not an unprimeable number, because it can be changed into a prime (32863485251) 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, 1340145 + ... + 1364446.
It is an arithmetic number, because the mean of its divisors is an integer number (4259732400).
Almost surely, 232863485241 is an apocalyptic number.
It is an amenable number.
32863485241 is a deficient number, since it is larger than the sum of its proper divisors (1214373959).
32863485241 is a wasteful number, since it uses less digits than its factorization.
32863485241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2705039.
The product of its digits is 1105920, while the sum is 46.
The spelling of 32863485241 in words is "thirty-two billion, eight hundred sixty-three million, four hundred eighty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •