Base | Representation |
---|---|
bin | 1000000111101… |
… | …00111010001101 |
3 | 11202011110010011 |
4 | 10003310322031 |
5 | 114414041023 |
6 | 10431513221 |
7 | 1454641204 |
oct | 403647215 |
9 | 152143104 |
10 | 68112013 |
11 | 354a1622 |
12 | 1a988811 |
13 | 1115a388 |
14 | 909023b |
15 | 5ea650d |
hex | 40f4e8d |
68112013 has 4 divisors (see below), whose sum is σ = 72118620. Its totient is φ = 64105408.
The previous prime is 68112007. The next prime is 68112061. The reversal of 68112013 is 31021186.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 53042089 + 15069924 = 7283^2 + 3882^2 .
It is a cyclic number.
It is not a de Polignac number, because 68112013 - 213 = 68103821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68112413) by changing a digit.
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, 2003278 + ... + 2003311.
It is an arithmetic number, because the mean of its divisors is an integer number (18029655).
Almost surely, 268112013 is an apocalyptic number.
It is an amenable number.
68112013 is a deficient number, since it is larger than the sum of its proper divisors (4006607).
68112013 is a wasteful number, since it uses less digits than its factorization.
68112013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4006606.
The product of its (nonzero) digits is 288, while the sum is 22.
The square root of 68112013 is about 8253.0002423361. Note that the first 3 decimals coincide. The cubic root of 68112013 is about 408.3895041243.
Adding to 68112013 its reverse (31021186), we get a palindrome (99133199).
The spelling of 68112013 in words is "sixty-eight million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •