Base | Representation |
---|---|
bin | 100111001011… |
… | …110011100001 |
3 | 201022212111022 |
4 | 213023303201 |
5 | 10112200334 |
6 | 1004055225 |
7 | 153211301 |
oct | 47136341 |
9 | 21285438 |
10 | 10271969 |
11 | 5886534 |
12 | 3534515 |
13 | 21885b6 |
14 | 1515601 |
15 | d7d82e |
hex | 9cbce1 |
10271969 has 4 divisors (see below), whose sum is σ = 10510896. Its totient is φ = 10033044.
The previous prime is 10271957. The next prime is 10272001. The reversal of 10271969 is 96917201.
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 10271969 - 220 = 9223393 is a prime.
It is a super-2 number, since 2×102719692 = 211026694273922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10271909) 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, 119399 + ... + 119484.
It is an arithmetic number, because the mean of its divisors is an integer number (2627724).
Almost surely, 210271969 is an apocalyptic number.
It is an amenable number.
10271969 is a deficient number, since it is larger than the sum of its proper divisors (238927).
10271969 is an equidigital number, since it uses as much as digits as its factorization.
10271969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238926.
The product of its (nonzero) digits is 6804, while the sum is 35.
The square root of 10271969 is about 3204.9912636386. The cubic root of 10271969 is about 217.3791568998.
It can be divided in two parts, 10271 and 969, that multiplied together give a palindrome (9952599).
The spelling of 10271969 in words is "ten million, two hundred seventy-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •