Base | Representation |
---|---|
bin | 110001010011010… |
… | …000100100000000 |
3 | 2010122101200000110 |
4 | 301103100210000 |
5 | 3143221212120 |
6 | 214024151320 |
7 | 26332336011 |
oct | 6123204400 |
9 | 2118350013 |
10 | 827132160 |
11 | 3949926a8 |
12 | 1b1008540 |
13 | 10249271a |
14 | 7bbcd008 |
15 | 4c9362e0 |
hex | 314d0900 |
827132160 has 72 divisors (see below), whose sum is σ = 2641665600. Its totient is φ = 220567552.
The previous prime is 827132147. The next prime is 827132167. The reversal of 827132160 is 61231728.
It is a super-2 number, since 2×8271321602 = 1368295220212531200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (827132167) 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, 103860 + ... + 111539.
It is an arithmetic number, because the mean of its divisors is an integer number (36689800).
Almost surely, 2827132160 is an apocalyptic number.
827132160 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
827132160 is an abundant number, since it is smaller than the sum of its proper divisors (1814533440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
827132160 is a wasteful number, since it uses less digits than its factorization.
827132160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215423 (or 215409 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 827132160 is about 28759.9054240448. The cubic root of 827132160 is about 938.6960038753.
Adding to 827132160 its reverse (61231728), we get a palindrome (888363888).
The spelling of 827132160 in words is "eight hundred twenty-seven million, one hundred thirty-two thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •