Nerdulator> put something in

Recognised as Number

42,316

  • Positive
  • Even
  • Composite
  • 5 digits

42,316 is an even 5-digit integer and a composite number. It has 12 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value42,316
Digit count5
Digit sum16
Digit product144
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 71 × 149
Distinct prime factors32, 71, 149
Number of divisors12
Sum of divisors σ(n)75,600
Aliquot sum33,284sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)20,720integers below n that share no factor with it
Carmichael function λ(n)5,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,720
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 71, 142, 149, 284, 298, 596, 10,579, 21,158, 42,31612 in total

Arithmetic

Previous number42,315
Next number42,317
Double84,632
Half21,158
Square root205.708531666≈irrational, shown to 9 decimal places
Cube root34.847225266≈
Negation-42,316
Reciprocal0.0000236317≈

Representations

Decimal42,316
Binary101001010100110016 bits
Octal122514
HexadecimalA54C
Base 36WNG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-two thousand, three hundred and sixteen
Ordinalforty-two thousand, three hundred and sixteenth
Scientific notation4.2316 × 10^4
Engineering notation42.316 × 10^3

In other bases

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

Bit-level

1010010101001100
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes2a5 4c
Gray code1111011111101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010010101001100
32-bit00000000000000001010010101001100
64-bit0000000000000000000000000000000000000000000000001010010101001100
One's complement0101101010110011at 16 bits, every bit flipped
Bits reversed0011001010100101at 16 bits
Rotated left by 10100101010011001at 16 bits, wrapping
Shifted left by 110100101010011000= 84,632, no wrap
Shifted right by 1101001010100110= 21,158, discarding the low bit
These bits as a double2.09068819 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime42,323+7
Previous prime42,307−9
Distance to nearest prime7
Nearest square below42,025
Nearest square above42,436

Powers & multiples

42,316 to the power 21,790,643,856
42,316 to the power 375,772,885,410,496
42,316 to the power 43,206,405,419,030,548,736
42,316 to the power 5135,682,251,711,696,700,312,576
First ten multiples42,316, 84,632, 126,948, 169,264, 211,580, 253,896, 296,212, 338,528, 380,844, 423,160
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 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 4
Divisible by 100No, remainder 16

Collatz (3n + 1) trajectory

Steps to reach 157the total stopping time
Highest value reached135,5923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps42,316 → 21,158 → 10,579 → 31,738 → 15,869 → 47,608 → 23,804 → 11,902 → 5,951 → 17,854 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,231,600%
42,316% as a decimal423.16
42,316% of 10042,316
42,316% of 1,000423,160
As a fraction of 10042,316/100

Read another way

As bytes41.324 KiB
As a 24-bit colour#00A54C

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 “42316” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.