Recognised as Number

42,835

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value42,835

Digit count5

Digit sum22

Digit product960

Multiplicative persistence2times 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 factorisation5 × 13 × 659

Distinct prime factors35, 13, 659

Number of divisors8

Sum of divisors σ(n)55,440

Aliquot sum12,605sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)31,584integers below n that share no factor with it

Carmichael function λ(n)3,948the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 31,584

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 13, 65, 659, 3,295, 8,567, 42,8358 in total

Arithmetic

Previous number42,834

Next number42,836

Double85,670

Half21,417.5

Square1,834,837,225

Cube78,595,252,532,875

Square root206.966180812≈irrational, shown to 9 decimal places

Cube root34.98911226≈

Negation-42,835

Reciprocal0.0000233454≈

Representations

Decimal42,835

Binary101001110101001116 bits

Octal123523

HexadecimalA753

Base 36X1V

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsforty-two thousand, eight hundred and thirty-five

Ordinalforty-two thousand, eight hundred and thirty-fifth

Scientific notation4.2835 × 10^4

Engineering notation42.835 × 10^3

In other bases

Ternary2011202111base 3; the most digit-efficient integer base after e: 10 digits

Quinary2332320base 5; one hand: 7 digits

Septenary235612base 7: 6 digits

Nonary64674base 9; each digit is two ternary digits: 5 digits

Duodecimal20957base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal571fbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal11:53:55base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1T1TTT1T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11111101101010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1010011101010011

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 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

Bytes2a7 53

Gray code1111010011111010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1010011101010011

32-bit00000000000000001010011101010011

64-bit0000000000000000000000000000000000000000000000001010011101010011

One's complement0101100010101100at 16 bits, every bit flipped

Bits reversed1100101011100101at 16 bits

Rotated left by 10100111010100111at 16 bits, wrapping

Shifted left by 110100111010100110= 85,670, no wrap

Shifted right by 1101001110101001= 21,417, discarding the low bit

These bits as a double2.11633019 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime42,839+4

Previous prime42,829−6

Distance to nearest prime4

Nearest square below42,436

Nearest square above42,849

Powers & multiples

42,835 to the power 21,834,837,225

42,835 to the power 378,595,252,532,875

42,835 to the power 43,366,627,642,245,700,625

42,835 to the power 5144,209,495,055,594,586,271,875

First ten multiples42,835, 85,670, 128,505, 171,340, 214,175, 257,010, 299,845, 342,680, 385,515, 428,350

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 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 7

Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 1238the total stopping time

Highest value reached365,9568× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps42,835 → 128,506 → 64,253 → 192,760 → 96,380 → 48,190 → 24,095 → 72,286 → 36,143 → 108,430 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage4,283,500%

42,835% as a decimal428.35

42,835% of 10042,835

42,835% of 1,000428,350

As a fraction of 10042,835/100

Read another way

As seconds11 hours, 53 minutes and 55 seconds

As bytes41.831 KiB

As a 24-bit colour#00A753

Keep nerding

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