Recognised as Number

42,357

Positive
Odd
Composite
5 digits

42,357 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 value42,357

Digit count5

Digit sum21

Digit product840

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 2,017

Distinct prime factors33, 7, 2,017

Number of divisors8

Sum of divisors σ(n)64,576

Aliquot sum22,219sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 21, 2,017, 6,051, 14,119, 42,3578 in total

Arithmetic

Previous number42,356

Next number42,358

Double84,714

Half21,178.5

Square1,794,115,449

Cube75,993,348,073,293

Square root205.808163103≈irrational, shown to 9 decimal places

Cube root34.858476133≈

Negation-42,357

Reciprocal0.0000236088≈

Representations

Decimal42,357

Binary101001010111010116 bits

Octal122565

HexadecimalA575

Base 36WOL

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

In wordsforty-two thousand, three hundred and fifty-seven

Ordinalforty-two thousand, three hundred and fifty-seventh

Scientific notation4.2357 × 10^4

Engineering notation42.357 × 10^3

In other bases

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

Quinary2323412base 5; one hand: 7 digits

Septenary234330base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010010101110101

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2a5 75

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

At each machine width

16-bit1010010101110101

32-bit00000000000000001010010101110101

64-bit0000000000000000000000000000000000000000000000001010010101110101

One's complement0101101010001010at 16 bits, every bit flipped

Bits reversed1010111010100101at 16 bits

Rotated left by 10100101011101011at 16 bits, wrapping

Shifted left by 110100101011101010= 84,714, no wrap

Shifted right by 1101001010111010= 21,178, discarding the low bit

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

Nearest landmarks

Next prime42,359+2

Previous prime42,349−8

Distance to nearest prime2

Nearest square below42,025

Nearest square above42,436

Powers & multiples

42,357 to the power 21,794,115,449

42,357 to the power 375,993,348,073,293

42,357 to the power 43,218,850,244,340,471,601

42,357 to the power 5136,340,839,799,529,355,603,557

First ten multiples42,357, 84,714, 127,071, 169,428, 211,785, 254,142, 296,499, 338,856, 381,213, 423,570

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 157the total stopping time

Highest value reached127,0723× the starting value

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

First steps42,357 → 127,072 → 63,536 → 31,768 → 15,884 → 7,942 → 3,971 → 11,914 → 5,957 → 17,872 → …

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

As a percentage & fraction

As a percentage4,235,700%

42,357% as a decimal423.57

42,357% of 10042,357

42,357% of 1,000423,570

As a fraction of 10042,357/100

Read another way

As seconds11 hours, 45 minutes and 57 seconds

As bytes41.364 KiB

As a 24-bit colour#00A575

Keep nerding

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