Recognised as Number

42,753

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value42,753

Digit count5

Digit sum21

Digit product840

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 14,251

Distinct prime factors23, 14,251

Number of divisors4

Sum of divisors σ(n)57,008

Aliquot sum14,255sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,250the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,500

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 14,251, 42,7534 in total

Arithmetic

Previous number42,752

Next number42,754

Double85,506

Half21,376.5

Square1,827,819,009

Cube78,144,746,091,777

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

Cube root34.966771184≈

Negation-42,753

Reciprocal0.0000233902≈

Representations

Decimal42,753

Binary101001110000000116 bits

Octal123401

HexadecimalA701

Base 36WZL

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

In wordsforty-two thousand, seven hundred and fifty-three

Ordinalforty-two thousand, seven hundred and fifty-third

Scientific notation4.2753 × 10^4

Engineering notation42.753 × 10^3

In other bases

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

Quinary2332003base 5; one hand: 7 digits

Septenary235434base 7: 6 digits

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

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

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

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

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

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

Bit-level

1010011100000001

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

Bytes2a7 01

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

At each machine width

16-bit1010011100000001

32-bit00000000000000001010011100000001

64-bit0000000000000000000000000000000000000000000000001010011100000001

One's complement0101100011111110at 16 bits, every bit flipped

Bits reversed1000000011100101at 16 bits

Rotated left by 10100111000000011at 16 bits, wrapping

Shifted left by 110100111000000010= 85,506, no wrap

Shifted right by 1101001110000000= 21,376, discarding the low bit

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

Nearest landmarks

Next prime42,767+14

Previous prime42,751−2

Distance to nearest prime2

Nearest square below42,436

Nearest square above42,849

Powers & multiples

42,753 to the power 21,827,819,009

42,753 to the power 378,144,746,091,777

42,753 to the power 43,340,922,329,661,742,081

42,753 to the power 5142,834,452,360,028,459,188,993

First ten multiples42,753, 85,506, 128,259, 171,012, 213,765, 256,518, 299,271, 342,024, 384,777, 427,530

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 3

Divisible by 10No, remainder 3

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached128,2603× the starting value

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

First steps42,753 → 128,260 → 64,130 → 32,065 → 96,196 → 48,098 → 24,049 → 72,148 → 36,074 → 18,037 → …

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

As a percentage & fraction

As a percentage4,275,300%

42,753% as a decimal427.53

42,753% of 10042,753

42,753% of 1,000427,530

As a fraction of 10042,753/100

Read another way

As seconds11 hours, 52 minutes and 33 seconds

As bytes41.751 KiB

As a 24-bit colour#00A701

Keep nerding

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