Base | Representation |
---|---|
bin | 1000001100001… |
… | …11001001111011 |
3 | 11210021212211011 |
4 | 10012013021323 |
5 | 120042223120 |
6 | 10452414351 |
7 | 1463014501 |
oct | 406071173 |
9 | 153255734 |
10 | 68711035 |
11 | 35870688 |
12 | 1b0173b7 |
13 | 11309c23 |
14 | 91a8671 |
15 | 6073c5a |
hex | 418727b |
68711035 has 16 divisors (see below), whose sum is σ = 87420672. Its totient is φ = 51753600.
The previous prime is 68711029. The next prime is 68711047. The reversal of 68711035 is 53011786.
It is not a de Polignac number, because 68711035 - 25 = 68711003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 68710988 and 68711006.
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 15 ways as a sum of consecutive naturals, for example, 256 + ... + 11725.
It is an arithmetic number, because the mean of its divisors is an integer number (5463792).
Almost surely, 268711035 is an apocalyptic number.
68711035 is a deficient number, since it is larger than the sum of its proper divisors (18709637).
68711035 is a wasteful number, since it uses less digits than its factorization.
68711035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12054.
The product of its (nonzero) digits is 5040, while the sum is 31.
The square root of 68711035 is about 8289.2119649578. The cubic root of 68711035 is about 409.5832270906.
The spelling of 68711035 in words is "sixty-eight million, seven hundred eleven thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •