Base | Representation |
---|---|
bin | 10011111110101… |
… | …111001000010001 |
3 | 212100202120220000 |
4 | 103332233020101 |
5 | 1141303304243 |
6 | 53132440213 |
7 | 11210156406 |
oct | 2376571021 |
9 | 770676800 |
10 | 335213073 |
11 | 1622455a8 |
12 | 94319069 |
13 | 545a9840 |
14 | 3273c2ad |
15 | 1e6675d3 |
hex | 13faf211 |
335213073 has 40 divisors (see below), whose sum is σ = 541233000. Its totient is φ = 205535232.
The previous prime is 335213069. The next prime is 335213093. The reversal of 335213073 is 370312533.
335213073 is a `hidden beast` number, since 3 + 352 + 1 + 307 + 3 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 762129 + 334450944 = 873^2 + 18288^2 .
It is not a de Polignac number, because 335213073 - 22 = 335213069 is a prime.
It is a super-2 number, since 2×3352130732 = 224735608620206658, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (335213003) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 472443 + ... + 473151.
It is an arithmetic number, because the mean of its divisors is an integer number (13530825).
Almost surely, 2335213073 is an apocalyptic number.
It is an amenable number.
335213073 is a deficient number, since it is larger than the sum of its proper divisors (206019927).
335213073 is a wasteful number, since it uses less digits than its factorization.
335213073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1183 (or 1174 counting only the distinct ones).
The product of its (nonzero) digits is 5670, while the sum is 27.
The square root of 335213073 is about 18308.8250032600. The cubic root of 335213073 is about 694.6621707506.
The spelling of 335213073 in words is "three hundred thirty-five million, two hundred thirteen thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •