Base | Representation |
---|---|
bin | 1000001000010… |
… | …11111011011101 |
3 | 11202100020110022 |
4 | 10010023323131 |
5 | 114430100201 |
6 | 10433521525 |
7 | 1455513122 |
oct | 404137335 |
9 | 152306408 |
10 | 68206301 |
11 | 35556449 |
12 | 1aa132a5 |
13 | 11191277 |
14 | 90b6749 |
15 | 5ec441b |
hex | 410bedd |
68206301 has 4 divisors (see below), whose sum is σ = 69362400. Its totient is φ = 67050204.
The previous prime is 68206253. The next prime is 68206331. The reversal of 68206301 is 10360286.
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: 10360286 = 2 ⋅5180143.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-68206301 is a prime.
It is a super-2 number, since 2×682063012 = 9304198992205202, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68206331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 577961 + ... + 578078.
It is an arithmetic number, because the mean of its divisors is an integer number (17340600).
Almost surely, 268206301 is an apocalyptic number.
It is an amenable number.
68206301 is a deficient number, since it is larger than the sum of its proper divisors (1156099).
68206301 is a wasteful number, since it uses less digits than its factorization.
68206301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1156098.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 68206301 is about 8258.7106136491. The cubic root of 68206301 is about 408.5778628457.
Adding to 68206301 its reverse (10360286), we get a palindrome (78566587).
The spelling of 68206301 in words is "sixty-eight million, two hundred six thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •