Recognised as Number

10,394

Positive
Even
Composite
5 digits

10,394 is an even 5-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value10,394

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5,197

Distinct prime factors22, 5,197

Number of divisors4

Sum of divisors σ(n)15,594

Aliquot sum5,200sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)5,196integers below n that share no factor with it

Carmichael function λ(n)5,196the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 5,197, 10,3944 in total

Arithmetic

Previous number10,393

Next number10,395

Double20,788

Half5,197

Square108,035,236

Cube1,122,918,242,984

Square root101.950968607≈irrational, shown to 9 decimal places

Cube root21.823659189≈

Negation-10,394

Reciprocal0.0000962094≈

Representations

Decimal10,394

Binary1010001001101014 bits

Octal24232

Hexadecimal289A

Base 3680Q

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsten thousand, three hundred and ninety-four

Ordinalten thousand, three hundred and ninety-fourth

Scientific notation1.0394 × 10^4

Engineering notation10.394 × 10^3

In other bases

Ternary112020222base 3; the most digit-efficient integer base after e: 9 digits

Quinary313034base 5; one hand: 6 digits

Septenary42206base 7: 5 digits

Nonary15228base 9; each digit is two ternary digits: 5 digits

Duodecimal6022base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits

Vigesimal15jebase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal2:53:14base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1TTT1T100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary111100111101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0010100010011010

Bit length14 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits8within that length

Bit parityeven6 set bits, so even; not the same as the number itself being even

Highest set bitbit 13worth 8,192

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes228 9a

Gray code11110011010111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0010100010011010

32-bit00000000000000000010100010011010

64-bit0000000000000000000000000000000000000000000000000010100010011010

One's complement1101011101100101at 16 bits, every bit flipped

Bits reversed0101100100010100at 16 bits

Rotated left by 10101000100110100at 16 bits, wrapping

Shifted left by 1101000100110100= 20,788, no wrap

Shifted right by 11010001001101= 5,197, discarding the low bit

These bits as a double5.13531832 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime10,399+5

Previous prime10,391−3

Distance to nearest prime3

Nearest square below10,201

Nearest square above10,404

Powers & multiples

10,394 to the power 2108,035,236

10,394 to the power 31,122,918,242,984

10,394 to the power 411,671,612,217,575,696

10,394 to the power 5121,314,737,389,481,784,224

First ten multiples10,394, 20,788, 31,182, 41,576, 51,970, 62,364, 72,758, 83,152, 93,546, 103,940

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6No, remainder 2

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 8

Divisible by 10No, remainder 4

Divisible by 11No, remainder 10

Divisible by 12No, remainder 2

Divisible by 100No, remainder 94

Collatz (3n + 1) trajectory

Steps to reach 1148the total stopping time

Highest value reached15,5921× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps10,394 → 5,197 → 15,592 → 7,796 → 3,898 → 1,949 → 5,848 → 2,924 → 1,462 → 731 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage1,039,400%

10,394% as a decimal103.94

10,394% of 10010,394

10,394% of 1,000103,940

As a fraction of 10010,394/100

Read another way

As seconds2 hours, 53 minutes and 14 seconds

As bytes10.15 KiB

As a 24-bit colour#00289A

Keep nerding

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