Base | Representation |
---|---|
bin | 100110011001… |
… | …001110010111 |
3 | 200221100022001 |
4 | 212121032113 |
5 | 10034033131 |
6 | 555420131 |
7 | 151356262 |
oct | 46311627 |
9 | 20840261 |
10 | 10064791 |
11 | 5754910 |
12 | 3454647 |
13 | 21151c9 |
14 | 149dcd9 |
15 | d3c261 |
hex | 999397 |
10064791 has 4 divisors (see below), whose sum is σ = 10979784. Its totient is φ = 9149800.
The previous prime is 10064773. The next prime is 10064809. The reversal of 10064791 is 19746001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 19746001 = 11 ⋅1795091.
It is an interprime number because it is at equal distance from previous prime (10064773) and next prime (10064809).
It is not a de Polignac number, because 10064791 - 25 = 10064759 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 (10064191) 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, 457480 + ... + 457501.
It is an arithmetic number, because the mean of its divisors is an integer number (2744946).
Almost surely, 210064791 is an apocalyptic number.
10064791 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10064791 is a deficient number, since it is larger than the sum of its proper divisors (914993).
10064791 is an equidigital number, since it uses as much as digits as its factorization.
10064791 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 914992.
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 10064791 is about 3172.5054767486. The cubic root of 10064791 is about 215.9077609709.
The spelling of 10064791 in words is "ten million, sixty-four thousand, seven hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •