Base | Representation |
---|---|
bin | 10100000100110… |
… | …110000000000000 |
3 | 212110202221001120 |
4 | 110010312000000 |
5 | 1142211022310 |
6 | 53231032240 |
7 | 11226605151 |
oct | 2404660000 |
9 | 773687046 |
10 | 336814080 |
11 | 163139449 |
12 | 9496b680 |
13 | 54a1a495 |
14 | 32a37928 |
15 | 1e881b70 |
hex | 14136000 |
336814080 has 112 divisors (see below), whose sum is σ = 1078132464. Its totient is φ = 89784320.
The previous prime is 336814069. The next prime is 336814103. The reversal of 336814080 is 80418633.
It is a super-2 number, since 2×3368140802 = 226887448972492800, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121510 + ... + 124250.
Almost surely, 2336814080 is an apocalyptic number.
336814080 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 336814080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (539066232).
336814080 is an abundant number, since it is smaller than the sum of its proper divisors (741318384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
336814080 is an equidigital number, since it uses as much as digits as its factorization.
336814080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2775 (or 2751 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 33.
The square root of 336814080 is about 18352.4951982013. The cubic root of 336814080 is about 695.7663372057.
The spelling of 336814080 in words is "three hundred thirty-six million, eight hundred fourteen thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.284 sec. • engine limits •