Base | Representation |
---|---|
bin | 10100000100010… |
… | …010010110001110 |
3 | 212110111111201220 |
4 | 110010102112032 |
5 | 1142141334141 |
6 | 53223544210 |
7 | 11225426331 |
oct | 2404222616 |
9 | 773444656 |
10 | 336668046 |
11 | 163049760 |
12 | 948bb066 |
13 | 54998b80 |
14 | 329da618 |
15 | 1e853766 |
hex | 1411258e |
336668046 has 64 divisors (see below), whose sum is σ = 793981440. Its totient is φ = 93824640.
The previous prime is 336668021. The next prime is 336668053. The reversal of 336668046 is 640866633.
It is a super-2 number, since 2×3366680462 = 226690746394916232, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 336667989 and 336668007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 307476 + ... + 308568.
It is an arithmetic number, because the mean of its divisors is an integer number (12405960).
Almost surely, 2336668046 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 336668046, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (396990720).
336668046 is an abundant number, since it is smaller than the sum of its proper divisors (457313394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
336668046 is a wasteful number, since it uses less digits than its factorization.
336668046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1481.
The product of its (nonzero) digits is 373248, while the sum is 42.
The square root of 336668046 is about 18348.5161797896. The cubic root of 336668046 is about 695.6657671530.
The spelling of 336668046 in words is "three hundred thirty-six million, six hundred sixty-eight thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •