Nerdulator> put something in

Recognised as Number

42,304

  • Positive
  • Even
  • Composite
  • 5 digits

42,304 is an even 5-digit integer and a composite number. It has 14 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value42,304
Digit count5
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^6 × 661
Distinct prime factors22, 661
Number of divisors14
Sum of divisors σ(n)84,074
Aliquot sum41,770sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)21,120integers below n that share no factor with it
Carmichael function λ(n)2,640the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,120
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 661, 1,322, 2,644, 5,288, 10,576, 21,152, 42,30414 in total

Arithmetic

Previous number42,303
Next number42,305
Double84,608
Half21,152
Square root205.679362115≈irrational, shown to 9 decimal places
Cube root34.843930955≈
Negation-42,304
Reciprocal0.0000236384≈

Representations

Decimal42,304
Binary101001010100000016 bits
Octal122500
HexadecimalA540
Base 36WN4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-two thousand, three hundred and four
Ordinalforty-two thousand, three hundred and fourth
Scientific notation4.2304 × 10^4
Engineering notation42.304 × 10^3

In other bases

Ternary2011000211base 3; the most digit-efficient integer base after e: 10 digits
Quinary2323204base 5; one hand: 7 digits
Septenary234223base 7: 6 digits
Nonary64024base 9; each digit is two ternary digits: 5 digits
Duodecimal20594base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal55f4base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:45:4base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T011001T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110010101000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010010101000000
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes2a5 40
Gray code1111011111100000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010010101000000
32-bit00000000000000001010010101000000
64-bit0000000000000000000000000000000000000000000000001010010101000000
One's complement0101101010111111at 16 bits, every bit flipped
Bits reversed0000001010100101at 16 bits
Rotated left by 10100101010000001at 16 bits, wrapping
Shifted left by 110100101010000000= 84,608, no wrap
Shifted right by 1101001010100000= 21,152, discarding the low bit
These bits as a double2.09009531 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime42,307+3
Previous prime42,299−5
Distance to nearest prime3
Nearest square below42,025
Nearest square above42,436

Powers & multiples

42,304 to the power 21,789,628,416
42,304 to the power 375,708,440,510,464
42,304 to the power 43,202,769,867,354,669,056
42,304 to the power 5135,489,976,468,571,919,745,024
First ten multiples42,304, 84,608, 126,912, 169,216, 211,520, 253,824, 296,128, 338,432, 380,736, 423,040
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 1119the total stopping time
Highest value reached42,304
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps42,304 → 21,152 → 10,576 → 5,288 → 2,644 → 1,322 → 661 → 1,984 → 992 → 496 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,230,400%
42,304% as a decimal423.04
42,304% of 10042,304
42,304% of 1,000423,040
As a fraction of 10042,304/100

Read another way

As bytes41.313 KiB
As a 24-bit colour#00A540

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “42304” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.