Base | Representation |
---|---|
bin | 110101010101110… |
… | …100101011100000 |
3 | 2022100221022012010 |
4 | 311111310223200 |
5 | 3313044210443 |
6 | 224445032520 |
7 | 31114431345 |
oct | 6525645340 |
9 | 2270838163 |
10 | 894913248 |
11 | 41a178629 |
12 | 20b855740 |
13 | 113535288 |
14 | 86bd47cc |
15 | 53874733 |
hex | 35574ae0 |
894913248 has 48 divisors (see below), whose sum is σ = 2403789696. Its totient is φ = 291365760.
The previous prime is 894913237. The next prime is 894913267. The reversal of 894913248 is 842319498.
894913248 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 894913197 and 894913206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104268 + ... + 112523.
It is an arithmetic number, because the mean of its divisors is an integer number (50078952).
Almost surely, 2894913248 is an apocalyptic number.
It is an amenable number.
894913248 is an abundant number, since it is smaller than the sum of its proper divisors (1508876448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
894913248 is a wasteful number, since it uses less digits than its factorization.
894913248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216847 (or 216839 counting only the distinct ones).
The product of its digits is 497664, while the sum is 48.
The square root of 894913248 is about 29915.1006683915. The cubic root of 894913248 is about 963.6669820708. Note that the first 3 decimals are identical.
The spelling of 894913248 in words is "eight hundred ninety-four million, nine hundred thirteen thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •