Base | Representation |
---|---|
bin | 1000000111001… |
… | …00111010111001 |
3 | 11202001010021112 |
4 | 10003210322321 |
5 | 114404442041 |
6 | 10430250105 |
7 | 1454246234 |
oct | 403447271 |
9 | 152033245 |
10 | 68046521 |
11 | 354573a4 |
12 | 1a956935 |
13 | 1113661a |
14 | 907441b |
15 | 5e91deb |
hex | 40e4eb9 |
68046521 has 4 divisors (see below), whose sum is σ = 68159232. Its totient is φ = 67933812.
The previous prime is 68046493. The next prime is 68046527. The reversal of 68046521 is 12564086.
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: 12564086 = 2 ⋅6282043.
It is a cyclic number.
It is not a de Polignac number, because 68046521 - 218 = 67784377 is a prime.
It is a super-3 number, since 3×680465213 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (68046527) 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, 55445 + ... + 56658.
It is an arithmetic number, because the mean of its divisors is an integer number (17039808).
Almost surely, 268046521 is an apocalyptic number.
It is an amenable number.
68046521 is a deficient number, since it is larger than the sum of its proper divisors (112711).
68046521 is a wasteful number, since it uses less digits than its factorization.
68046521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112710.
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 68046521 is about 8249.0315189118. The cubic root of 68046521 is about 408.2585687171.
The spelling of 68046521 in words is "sixty-eight million, forty-six thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •