Nerdulator> put something in

Recognised as Number

42,035

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value42,035
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 × 7 × 1,201
Distinct prime factors35, 7, 1,201
Number of divisors8
Sum of divisors σ(n)57,696
Aliquot sum15,661sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)28,800integers below n that share no factor with it
Carmichael function λ(n)1,200the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,800
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 35, 1,201, 6,005, 8,407, 42,0358 in total

Arithmetic

Previous number42,034
Next number42,036
Double84,070
Square root205.024388793≈irrational, shown to 9 decimal places
Cube root34.769919398≈
Negation-42,035
Reciprocal0.0000237897≈

Representations

Decimal42,035
Binary101001000011001116 bits
Octal122063
HexadecimalA433
Base 36WFN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-two thousand and thirty-five
Ordinalforty-two thousand and thirty-fifth
Scientific notation4.2035 × 10^4
Engineering notation42.035 × 10^3

In other bases

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

Bit-level

1010010000110011
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
Bytes2a4 33
Gray code1111011000101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010010000110011
32-bit00000000000000001010010000110011
64-bit0000000000000000000000000000000000000000000000001010010000110011
One's complement0101101111001100at 16 bits, every bit flipped
Bits reversed1100110000100101at 16 bits
Rotated left by 10100100001100111at 16 bits, wrapping
Shifted left by 110100100001100110= 84,070, no wrap
Shifted right by 1101001000011001= 21,017, discarding the low bit
These bits as a double2.07680494 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime42,043+8
Previous prime42,023−12
Distance to nearest prime8
Nearest square below42,025
Nearest square above42,436

Powers & multiples

42,035 to the power 21,766,941,225
42,035 to the power 374,273,374,392,875
42,035 to the power 43,122,081,292,604,500,625
42,035 to the power 5131,236,687,134,630,183,771,875
First ten multiples42,035, 84,070, 126,105, 168,140, 210,175, 252,210, 294,245, 336,280, 378,315, 420,350
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 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time
Highest value reached189,1604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps42,035 → 126,106 → 63,053 → 189,160 → 94,580 → 47,290 → 23,645 → 70,936 → 35,468 → 17,734 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,203,500%
42,035% as a decimal420.35
42,035% of 10042,035
42,035% of 1,000420,350
As a fraction of 10042,035/100

Read another way

As bytes41.05 KiB
As a 24-bit colour#00A433

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