Base | Representation |
---|---|
bin | 100110011111… |
… | …110110101111 |
3 | 200222201112222 |
4 | 212133312233 |
5 | 10040420301 |
6 | 1000145555 |
7 | 151531412 |
oct | 46376657 |
9 | 20881488 |
10 | 10091951 |
11 | 5773261 |
12 | 34682bb |
13 | 212468c |
14 | 14a9b79 |
15 | d4531b |
hex | 99fdaf |
10091951 has 4 divisors (see below), whose sum is σ = 10098312. Its totient is φ = 10085592.
The previous prime is 10091947. The next prime is 10091953. The reversal of 10091951 is 15919001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 15919001 = 7 ⋅2274143.
It is a cyclic number.
It is not a de Polignac number, because 10091951 - 22 = 10091947 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 10091951.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10091953) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1376 + ... + 4698.
It is an arithmetic number, because the mean of its divisors is an integer number (2524578).
Almost surely, 210091951 is an apocalyptic number.
10091951 is a deficient number, since it is larger than the sum of its proper divisors (6361).
10091951 is an equidigital number, since it uses as much as digits as its factorization.
10091951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6360.
The product of its (nonzero) digits is 405, while the sum is 26.
The square root of 10091951 is about 3176.7831213352. The cubic root of 10091951 is about 216.1017967249.
The spelling of 10091951 in words is "ten million, ninety-one thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •