Base | Representation |
---|---|
bin | 110001100110000… |
… | …011110110000001 |
3 | 2010222200001211201 |
4 | 301212003312001 |
5 | 3201001421201 |
6 | 214321541201 |
7 | 26422254145 |
oct | 6146036601 |
9 | 2128601751 |
10 | 832060801 |
11 | 397749660 |
12 | 1b27a4801 |
13 | 1034c9b90 |
14 | 7c713225 |
15 | 4d0ab801 |
hex | 31983d81 |
832060801 has 64 divisors (see below), whose sum is σ = 1091930112. Its totient is φ = 622080000.
The previous prime is 832060781. The next prime is 832060819. The reversal of 832060801 is 108060238.
It is a 3-Lehmer number, since φ(832060801) divides (832060801-1)3.
It is a cyclic number.
It is a Carmichael number.
It is not a de Polignac number, because 832060801 - 211 = 832058753 is a prime.
It is a deceptive number, since it divides R832060800.
It is a self number, because there is not a number n which added to its sum of digits gives 832060801.
It is not an unprimeable number, because it can be changed into a prime (832060861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4596931 + ... + 4597111.
It is an arithmetic number, because the mean of its divisors is an integer number (17061408).
It is a Poulet number, since it divides 2832060800-1.
Almost surely, 2832060801 is an apocalyptic number.
It is an amenable number.
832060801 is a deficient number, since it is larger than the sum of its proper divisors (259869311).
832060801 is a wasteful number, since it uses less digits than its factorization.
832060801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314.
The product of its (nonzero) digits is 2304, while the sum is 28.
The square root of 832060801 is about 28845.4641321647. The cubic root of 832060801 is about 940.5567853476.
The spelling of 832060801 in words is "eight hundred thirty-two million, sixty thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •