Nerdulator> put something in

Recognised as Number

42,305

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

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

Factors & divisors

Prime factorisation5 × 8,461
Distinct prime factors25, 8,461
Number of divisors4
Sum of divisors σ(n)50,772
Aliquot sum8,467sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)33,840integers below n that share no factor with it
Carmichael function λ(n)8,460the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 33,840
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 8,461, 42,3054 in total

Arithmetic

Previous number42,304
Next number42,306
Double84,610
Square root205.681793069≈irrational, shown to 9 decimal places
Cube root34.844205505≈
Negation-42,305
Reciprocal0.0000236379≈

Representations

Decimal42,305
Binary101001010100000116 bits
Octal122501
HexadecimalA541
Base 36WN5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-two thousand, three hundred and five
Ordinalforty-two thousand, three hundred and fifth
Scientific notation4.2305 × 10^4
Engineering notation42.305 × 10^3

In other bases

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

Bit-level

1010010101000001
Bit length16 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits10within that length
Bit parityeven6 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
Bytes2a5 41
Gray code1111011111100001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010010101000001
32-bit00000000000000001010010101000001
64-bit0000000000000000000000000000000000000000000000001010010101000001
One's complement0101101010111110at 16 bits, every bit flipped
Bits reversed1000001010100101at 16 bits
Rotated left by 10100101010000011at 16 bits, wrapping
Shifted left by 110100101010000010= 84,610, no wrap
Shifted right by 1101001010100000= 21,152, discarding the low bit
These bits as a double2.09014471 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime42,307+2
Previous prime42,299−6
Distance to nearest prime2
Nearest square below42,025
Nearest square above42,436

Powers & multiples

42,305 to the power 21,789,713,025
42,305 to the power 375,713,809,522,625
42,305 to the power 43,203,072,711,854,650,625
42,305 to the power 5135,505,991,075,010,994,690,625
First ten multiples42,305, 84,610, 126,915, 169,220, 211,525, 253,830, 296,135, 338,440, 380,745, 423,050
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 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 1106the total stopping time
Highest value reached126,9163× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps42,305 → 126,916 → 63,458 → 31,729 → 95,188 → 47,594 → 23,797 → 71,392 → 35,696 → 17,848 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,230,500%
42,305% as a decimal423.05
42,305% of 10042,305
42,305% of 1,000423,050
As a fraction of 10042,305/100

Read another way

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

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