Nerdulator> put something in

Recognised as Number

10,191

  • Positive
  • Odd
  • Composite
  • 5 digits

10,191 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value10,191
Digit count5
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 43 × 79
Distinct prime factors33, 43, 79
Number of divisors8
Sum of divisors σ(n)14,080
Aliquot sum3,889sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,552integers below n that share no factor with it
Carmichael function λ(n)546the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,552
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 43, 79, 129, 237, 3,397, 10,1918 in total

Arithmetic

Previous number10,190
Next number10,192
Double20,382
Square root100.950482911≈irrational, shown to 9 decimal places
Cube root21.680648438≈
Negation-10,191
Reciprocal0.0000981258≈

Representations

Decimal10,191
Binary1001111100111114 bits
Octal23717
Hexadecimal27CF
Base 367V3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsten thousand, one hundred and ninety-one
Ordinalten thousand, one hundred and ninety-first
Scientific notation1.0191 × 10^4
Engineering notation10.191 × 10^3

In other bases

Ternary111222110base 3; the most digit-efficient integer base after e: 9 digits
Quinary311231base 5; one hand: 6 digits
Septenary41466base 7: 5 digits
Nonary14873base 9; each digit is two ternary digits: 5 digits
Duodecimal5a93base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal159bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:49:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT00T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111100011010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010011111001111
Bit length14 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits4within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes227 cf
Gray code11010000101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010011111001111
32-bit00000000000000000010011111001111
64-bit0000000000000000000000000000000000000000000000000010011111001111
One's complement1101100000110000at 16 bits, every bit flipped
Bits reversed1111001111100100at 16 bits
Rotated left by 10100111110011110at 16 bits, wrapping
Shifted left by 1100111110011110= 20,382, no wrap
Shifted right by 11001111100111= 5,095, discarding the low bit
These bits as a double5.035023 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime10,193+2
Previous prime10,181−10
Distance to nearest prime2
Nearest square below10,000
Nearest square above10,201

Powers & multiples

10,191 to the power 2103,856,481
10,191 to the power 31,058,401,397,871
10,191 to the power 410,786,168,645,703,361
10,191 to the power 5109,921,844,668,362,951,951
First ten multiples10,191, 20,382, 30,573, 40,764, 50,955, 61,146, 71,337, 81,528, 91,719, 101,910
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time
Highest value reached103,19210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps10,191 → 30,574 → 15,287 → 45,862 → 22,931 → 68,794 → 34,397 → 103,192 → 51,596 → 25,798 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,019,100%
10,191% as a decimal101.91
10,191% of 10010,191
10,191% of 1,000101,910
As a fraction of 10010,191/100

Read another way

As bytes9.952 KiB
As a 24-bit colour#0027CF

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “10191” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.