Recognised as Number

42,867

Positive
Odd
Composite
5 digits

42,867 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value42,867

Digit count5

Digit sum27

Digit product2,688

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 11 × 433

Distinct prime factors33, 11, 433

Number of divisors12

Sum of divisors σ(n)67,704

Aliquot sum24,837sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,160the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,920

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 11, 33, 99, 433, 1,299, 3,897, 4,763, 14,289, 42,86712 in total

Arithmetic

Previous number42,866

Next number42,868

Double85,734

Half21,433.5

Square1,837,579,689

Cube78,771,528,528,363

Square root207.043473696≈irrational, shown to 9 decimal places

Cube root34.997822994≈

Negation-42,867

Reciprocal0.000023328≈

Representations

Decimal42,867

Binary101001110111001116 bits

Octal123563

HexadecimalA773

Base 36X2R

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

In wordsforty-two thousand, eight hundred and sixty-seven

Ordinalforty-two thousand, eight hundred and sixty-seventh

Scientific notation4.2867 × 10^4

Engineering notation42.867 × 10^3

In other bases

Ternary2011210200base 3; the most digit-efficient integer base after e: 10 digits

Quinary2332432base 5; one hand: 7 digits

Septenary235656base 7: 6 digits

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

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

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

Sexagesimal11:54:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1010011101110011

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2a7 73

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

At each machine width

16-bit1010011101110011

32-bit00000000000000001010011101110011

64-bit0000000000000000000000000000000000000000000000001010011101110011

One's complement0101100010001100at 16 bits, every bit flipped

Bits reversed1100111011100101at 16 bits

Rotated left by 10100111011100111at 16 bits, wrapping

Shifted left by 110100111011100110= 85,734, no wrap

Shifted right by 1101001110111001= 21,433, discarding the low bit

These bits as a double2.1179112 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime42,899+32

Previous prime42,863−4

Distance to nearest prime4

Nearest square below42,849

Nearest square above43,264

Powers & multiples

42,867 to the power 21,837,579,689

42,867 to the power 378,771,528,528,363

42,867 to the power 43,376,699,113,425,336,721

42,867 to the power 5144,748,960,895,203,909,219,107

First ten multiples42,867, 85,734, 128,601, 171,468, 214,335, 257,202, 300,069, 342,936, 385,803, 428,670

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1194the total stopping time

Highest value reached192,9044× the starting value

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

First steps42,867 → 128,602 → 64,301 → 192,904 → 96,452 → 48,226 → 24,113 → 72,340 → 36,170 → 18,085 → …

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

As a percentage & fraction

As a percentage4,286,700%

42,867% as a decimal428.67

42,867% of 10042,867

42,867% of 1,000428,670

As a fraction of 10042,867/100

Read another way

As seconds11 hours, 54 minutes and 27 seconds

As bytes41.862 KiB

As a 24-bit colour#00A773

Keep nerding

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