Base | Representation |
---|---|
bin | 110000011101100… |
… | …010111100000000 |
3 | 2002122220022012000 |
4 | 300131202330000 |
5 | 3131120123043 |
6 | 212402304000 |
7 | 26101552653 |
oct | 6035427400 |
9 | 2078808160 |
10 | 813051648 |
11 | 387a45812 |
12 | 1a8358000 |
13 | cc5a2766 |
14 | 79da589a |
15 | 4b5a42d3 |
hex | 30762f00 |
813051648 has 288 divisors, whose sum is σ = 2609779200. Its totient is φ = 248832000.
The previous prime is 813051593. The next prime is 813051677. The reversal of 813051648 is 846150318.
813051648 is a `hidden beast` number, since 8 + 1 + 3 + 0 + 5 + 1 + 648 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is a super-2 number, since 2×8130516482 = 1322105964631031808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5384373 + ... + 5384523.
Almost surely, 2813051648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 813051648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1304889600).
813051648 is an abundant number, since it is smaller than the sum of its proper divisors (1796727552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
813051648 is a wasteful number, since it uses less digits than its factorization.
813051648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 236 (or 216 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The square root of 813051648 is about 28514.0605316044. The cubic root of 813051648 is about 933.3389242295.
The spelling of 813051648 in words is "eight hundred thirteen million, fifty-one thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •