Base | Representation |
---|---|
bin | 1000000111100… |
… | …11001101010101 |
3 | 11202011002120002 |
4 | 10003303031111 |
5 | 114413330140 |
6 | 10431421045 |
7 | 1454611661 |
oct | 403631525 |
9 | 152132502 |
10 | 68105045 |
11 | 35497368 |
12 | 1a984785 |
13 | 11157158 |
14 | 908b8a1 |
15 | 5ea4415 |
hex | 40f3355 |
68105045 has 4 divisors (see below), whose sum is σ = 81726060. Its totient is φ = 54484032.
The previous prime is 68105027. The next prime is 68105087. The reversal of 68105045 is 54050186.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54050186 = 2 ⋅27025093.
It can be written as a sum of positive squares in 2 ways, for example, as 39225169 + 28879876 = 6263^2 + 5374^2 .
It is a cyclic number.
It is not a de Polignac number, because 68105045 - 210 = 68104021 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 68104999 and 68105017.
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 3 ways as a sum of consecutive naturals, for example, 6810500 + ... + 6810509.
It is an arithmetic number, because the mean of its divisors is an integer number (20431515).
Almost surely, 268105045 is an apocalyptic number.
It is an amenable number.
68105045 is a deficient number, since it is larger than the sum of its proper divisors (13621015).
68105045 is a wasteful number, since it uses less digits than its factorization.
68105045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13621014.
The product of its (nonzero) digits is 4800, while the sum is 29.
The square root of 68105045 is about 8252.5780820299. The cubic root of 68105045 is about 408.3755772853.
The spelling of 68105045 in words is "sixty-eight million, one hundred five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.777 sec. • engine limits •