Recognised as Number

10,392

Positive
Even
Composite
5 digits

10,392 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value10,392

Digit count5

Digit sum15

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 3 × 433

Distinct prime factors32, 3, 433

Number of divisors16

Sum of divisors σ(n)26,040

Aliquot sum15,648sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)432the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,456

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 12, 24, 433, 866, 1,299, 1,732, 2,598, 3,464, 5,196, 10,39216 in total

Arithmetic

Previous number10,391

Next number10,393

Double20,784

Half5,196

Square107,993,664

Cube1,122,270,156,288

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

Cube root21.822259339≈

Negation-10,392

Reciprocal0.0000962279≈

Representations

Decimal10,392

Binary1010001001100014 bits

Octal24230

Hexadecimal2898

Base 3680O

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

In wordsten thousand, three hundred and ninety-two

Ordinalten thousand, three hundred and ninety-second

Scientific notation1.0392 × 10^4

Engineering notation10.392 × 10^3

In other bases

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

Quinary313032base 5; one hand: 6 digits

Septenary42204base 7: 5 digits

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

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

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

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

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

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

Bit-level

0010100010011000

Bit length14 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes228 98

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

At each machine width

16-bit0010100010011000

32-bit00000000000000000010100010011000

64-bit0000000000000000000000000000000000000000000000000010100010011000

One's complement1101011101100111at 16 bits, every bit flipped

Bits reversed0001100100010100at 16 bits

Rotated left by 10101000100110000at 16 bits, wrapping

Shifted left by 1101000100110000= 20,784, no wrap

Shifted right by 11010001001100= 5,196, discarding the low bit

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

Nearest landmarks

Next prime10,399+7

Previous prime10,391−1

Distance to nearest prime1

Nearest square below10,201

Nearest square above10,404

Powers & multiples

10,392 to the power 2107,993,664

10,392 to the power 31,122,270,156,288

10,392 to the power 411,662,631,464,144,896

10,392 to the power 5121,198,066,175,393,759,232

First ten multiples10,392, 20,784, 31,176, 41,568, 51,960, 62,352, 72,744, 83,136, 93,528, 103,920

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 4

Divisible by 8Yes

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 8

Divisible by 12Yes

Divisible by 100No, remainder 92

Collatz (3n + 1) trajectory

Steps to reach 1148the total stopping time

Highest value reached10,392

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

First steps10,392 → 5,196 → 2,598 → 1,299 → 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,200%

10,392% as a decimal103.92

10,392% of 10010,392

10,392% of 1,000103,920

As a fraction of 10010,392/100

Read another way

As seconds2 hours, 53 minutes and 12 seconds

As bytes10.148 KiB

As a 24-bit colour#002898

Keep nerding

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