Nerdulator> put something in

Recognised as Number

42,307

  • Positive
  • Odd
  • Prime
  • 5 digits

42,307 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value42,307
Digit count5
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation42,307
Distinct prime factors142,307
Number of divisors2
Sum of divisors σ(n)42,308
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)42,306integers below n that share no factor with it
Carmichael function λ(n)42,306the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 42,3072 in total

Arithmetic

Previous number42,306
Next number42,308
Double84,614
Square root205.68665489≈irrational, shown to 9 decimal places
Cube root34.844754591≈
Negation-42,307
Reciprocal0.0000236368≈

Representations

Decimal42,307
Binary101001010100001116 bits
Octal122503
HexadecimalA543
Base 36WN7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-two thousand, three hundred and seven
Ordinalforty-two thousand, three hundred and seventh
Scientific notation4.2307 × 10^4
Engineering notation42.307 × 10^3

In other bases

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

Bit-level

1010010101000011
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 odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2a5 43
Gray code1111011111100010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010010101000011
32-bit00000000000000001010010101000011
64-bit0000000000000000000000000000000000000000000000001010010101000011
One's complement0101101010111100at 16 bits, every bit flipped
Bits reversed1100001010100101at 16 bits
Rotated left by 10100101010000111at 16 bits, wrapping
Shifted left by 110100101010000110= 84,614, no wrap
Shifted right by 1101001010100001= 21,153, discarding the low bit
These bits as a double2.09024353 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime42,323+16
Previous prime42,299−8
Distance to nearest prime0, it is prime
Nearest square below42,025
Nearest square above42,436

Powers & multiples

42,307 to the power 21,789,882,249
42,307 to the power 375,724,548,308,443
42,307 to the power 43,203,678,465,285,298,001
42,307 to the power 5135,538,024,830,825,102,528,307
First ten multiples42,307, 84,614, 126,921, 169,228, 211,535, 253,842, 296,149, 338,456, 380,763, 423,070
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time
Highest value reached190,3844× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps42,307 → 126,922 → 63,461 → 190,384 → 95,192 → 47,596 → 23,798 → 11,899 → 35,698 → 17,849 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,230,700%
42,307% as a decimal423.07
42,307% of 10042,307
42,307% of 1,000423,070
As a fraction of 10042,307/100

Read another way

As bytes41.315 KiB
As a 24-bit colour#00A543

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