Base | Representation |
---|---|
bin | 10100000011010… |
… | …001000101110001 |
3 | 212102222221002011 |
4 | 110003101011301 |
5 | 1142104311003 |
6 | 53214122521 |
7 | 11223234133 |
oct | 2403210561 |
9 | 772887064 |
10 | 336400753 |
11 | 162986957 |
12 | 947b0441 |
13 | 54904300 |
14 | 3296b053 |
15 | 1e7ee46d |
hex | 140d1171 |
336400753 has 12 divisors (see below), whose sum is σ = 368041548. Its totient is φ = 307307520.
The previous prime is 336400741. The next prime is 336400759. The reversal of 336400753 is 357004633.
It can be written as a sum of positive squares in 6 ways, for example, as 38044224 + 298356529 = 6168^2 + 17273^2 .
It is not a de Polignac number, because 336400753 - 213 = 336392561 is a prime.
It is a super-3 number, since 3×3364007533 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (336400759) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 6133 + ... + 26653.
It is an arithmetic number, because the mean of its divisors is an integer number (30670129).
Almost surely, 2336400753 is an apocalyptic number.
It is an amenable number.
336400753 is a deficient number, since it is larger than the sum of its proper divisors (31640795).
336400753 is a wasteful number, since it uses less digits than its factorization.
336400753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20644 (or 20631 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 31.
The square root of 336400753 is about 18341.2309565089. The cubic root of 336400753 is about 695.4816136287.
The spelling of 336400753 in words is "three hundred thirty-six million, four hundred thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •