Base | Representation |
---|---|
bin | 10100000100110… |
… | …010000101100000 |
3 | 212110202010001210 |
4 | 110010302011200 |
5 | 1142210014143 |
6 | 53230430120 |
7 | 11226510336 |
oct | 2404620540 |
9 | 773663053 |
10 | 336798048 |
11 | 1631283a4 |
12 | 94962340 |
13 | 54a130b2 |
14 | 32a31b56 |
15 | 1e87c033 |
hex | 14132160 |
336798048 has 24 divisors (see below), whose sum is σ = 884095128. Its totient is φ = 112265984.
The previous prime is 336798041. The next prime is 336798061. The reversal of 336798048 is 840897633.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×3367980482 = 226865850273220608, which contains 22 as substring.
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 = 336797988 and 336798006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (336798041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1754061 + ... + 1754252.
It is an arithmetic number, because the mean of its divisors is an integer number (36837297).
Almost surely, 2336798048 is an apocalyptic number.
It is an amenable number.
336798048 is an abundant number, since it is smaller than the sum of its proper divisors (547297080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
336798048 is a wasteful number, since it uses less digits than its factorization.
336798048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3508326 (or 3508318 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 48.
The square root of 336798048 is about 18352.0584131590. The cubic root of 336798048 is about 695.7552977791.
The spelling of 336798048 in words is "three hundred thirty-six million, seven hundred ninety-eight thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •