Recognised as Number

42,869

Positive
Odd
Composite
5 digits

42,869 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value42,869

Digit count5

Digit sum29

Digit product3,456

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation163 × 263

Distinct prime factors2163, 263

Number of divisors4

Sum of divisors σ(n)43,296

Aliquot sum427sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)21,222the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 42,444

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

SquarefreeYesno repeated prime factor

All divisors1, 163, 263, 42,8694 in total

Arithmetic

Previous number42,868

Next number42,870

Double85,738

Half21,434.5

Square1,837,751,161

Cube78,782,554,520,909

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

Cube root34.998367271≈

Negation-42,869

Reciprocal0.0000233269≈

Representations

Decimal42,869

Binary101001110111010116 bits

Octal123565

HexadecimalA775

Base 36X2T

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

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

Ordinalforty-two thousand, eight hundred and sixty-ninth

Scientific notation4.2869 × 10^4

Engineering notation42.869 × 10^3

In other bases

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

Quinary2332434base 5; one hand: 7 digits

Septenary235661base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010011101110101

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 75

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

At each machine width

16-bit1010011101110101

32-bit00000000000000001010011101110101

64-bit0000000000000000000000000000000000000000000000001010011101110101

One's complement0101100010001010at 16 bits, every bit flipped

Bits reversed1010111011100101at 16 bits

Rotated left by 10100111011101011at 16 bits, wrapping

Shifted left by 110100111011101010= 85,738, no wrap

Shifted right by 1101001110111010= 21,434, discarding the low bit

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

Nearest landmarks

Next prime42,899+30

Previous prime42,863−6

Distance to nearest prime6

Nearest square below42,849

Nearest square above43,264

Powers & multiples

42,869 to the power 21,837,751,161

42,869 to the power 378,782,554,520,909

42,869 to the power 43,377,329,329,756,847,921

42,869 to the power 5144,782,731,037,346,313,525,349

First ten multiples42,869, 85,738, 128,607, 171,476, 214,345, 257,214, 300,083, 342,952, 385,821, 428,690

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 2

Divisible by 12No, remainder 5

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 131the total stopping time

Highest value reached128,6083× the starting value

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

First steps42,869 → 128,608 → 64,304 → 32,152 → 16,076 → 8,038 → 4,019 → 12,058 → 6,029 → 18,088 → …

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

As a percentage & fraction

As a percentage4,286,900%

42,869% as a decimal428.69

42,869% of 10042,869

42,869% of 1,000428,690

As a fraction of 10042,869/100

Read another way

As seconds11 hours, 54 minutes and 29 seconds

As bytes41.864 KiB

As a 24-bit colour#00A775

Keep nerding

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