Base | Representation |
---|---|
bin | 1000001001010… |
… | …11100110111001 |
3 | 11202120211110002 |
4 | 10010223212321 |
5 | 114443223212 |
6 | 10440402345 |
7 | 1456563326 |
oct | 404534671 |
9 | 152524402 |
10 | 68336057 |
11 | 35634989 |
12 | 1aa763b5 |
13 | 1120834a |
14 | 910bb4d |
15 | 5eecac2 |
hex | 412b9b9 |
68336057 has 4 divisors (see below), whose sum is σ = 68492160. Its totient is φ = 68179956.
The previous prime is 68336041. The next prime is 68336083. The reversal of 68336057 is 75063386.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 75063386 = 2 ⋅37531693.
It is a cyclic number.
It is not a de Polignac number, because 68336057 - 24 = 68336041 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 68336057.
It is not an unprimeable number, because it can be changed into a prime (68336017) 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, 77393 + ... + 78270.
It is an arithmetic number, because the mean of its divisors is an integer number (17123040).
Almost surely, 268336057 is an apocalyptic number.
It is an amenable number.
68336057 is a deficient number, since it is larger than the sum of its proper divisors (156103).
68336057 is a wasteful number, since it uses less digits than its factorization.
68336057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156102.
The product of its (nonzero) digits is 90720, while the sum is 38.
The square root of 68336057 is about 8266.5625867104. The cubic root of 68336057 is about 408.8367922259.
The spelling of 68336057 in words is "sixty-eight million, three hundred thirty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •