Base | Representation |
---|---|
bin | 1000010110111… |
… | …0100111000110 |
3 | 2102222000212222 |
4 | 2011232213012 |
5 | 32433243240 |
6 | 3251212342 |
7 | 603654200 |
oct | 205564706 |
9 | 72860788 |
10 | 35056070 |
11 | 18874165 |
12 | b8a70b2 |
13 | 735544a |
14 | 4927770 |
15 | 3126eb5 |
hex | 216e9c6 |
35056070 has 48 divisors (see below), whose sum is σ = 75965040. Its totient is φ = 11600064.
The previous prime is 35056069. The next prime is 35056081. The reversal of 35056070 is 7065053.
35056070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 12977 + ... + 15443.
It is an arithmetic number, because the mean of its divisors is an integer number (1582605).
Almost surely, 235056070 is an apocalyptic number.
35056070 is an abundant number, since it is smaller than the sum of its proper divisors (40908970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
35056070 is a wasteful number, since it uses less digits than its factorization.
35056070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2517 (or 2510 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 26.
The square root of 35056070 is about 5920.8166666432. The cubic root of 35056070 is about 327.2812127663.
The spelling of 35056070 in words is "thirty-five million, fifty-six thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •