Base | Representation |
---|---|
bin | 1000000010011… |
… | …01011011010001 |
3 | 11200212121002022 |
4 | 10001031123101 |
5 | 114230113001 |
6 | 10405101225 |
7 | 1446053156 |
oct | 401153321 |
9 | 150777068 |
10 | 67426001 |
11 | 35073175 |
12 | 1a6b7815 |
13 | 10c7a056 |
14 | 8d5222d |
15 | 5dbd11b |
hex | 404d6d1 |
67426001 has 4 divisors (see below), whose sum is σ = 67602432. Its totient is φ = 67249572.
The previous prime is 67425997. The next prime is 67426013. The reversal of 67426001 is 10062476.
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.
It is a cyclic number.
It is not a de Polignac number, because 67426001 - 22 = 67425997 is a prime.
It is a super-2 number, since 2×674260012 = 9092531221704002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (67426031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87641 + ... + 88406.
It is an arithmetic number, because the mean of its divisors is an integer number (16900608).
Almost surely, 267426001 is an apocalyptic number.
It is an amenable number.
67426001 is a deficient number, since it is larger than the sum of its proper divisors (176431).
67426001 is a wasteful number, since it uses less digits than its factorization.
67426001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176430.
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 67426001 is about 8211.3336919163. Note that the first 3 decimals coincide. The cubic root of 67426001 is about 407.0137997965.
Adding to 67426001 its reverse (10062476), we get a palindrome (77488477).
The spelling of 67426001 in words is "sixty-seven million, four hundred twenty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •