Recognised as Number

75,513

Positive
Odd
Composite
5 digits

75,513 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 value75,513

Digit count5

Digit sum21

Digit product525

Multiplicative persistence3times 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 × 25,171

Distinct prime factors23, 25,171

Number of divisors4

Sum of divisors σ(n)100,688

Aliquot sum25,175sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)25,170the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 50,340

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 25,171, 75,5134 in total

Arithmetic

Previous number75,512

Next number75,514

Double151,026

Half37,756.5

Square5,702,213,169

Cube430,591,223,030,697

Square root274.796288185≈irrational, shown to 9 decimal places

Cube root42.267566193≈

Negation-75,513

Reciprocal0.0000132428≈

Representations

Decimal75,513

Binary1001001101111100117 bits

Octal223371

Hexadecimal126F9

Base 361M9L

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

In wordsseventy-five thousand, five hundred and thirteen

Ordinalseventy-five thousand, five hundred and thirteenth

Scientific notation7.5513 × 10^4

Engineering notation75.513 × 10^3

In other bases

Ternary10211120210base 3; the most digit-efficient integer base after e: 11 digits

Quinary4404023base 5; one hand: 7 digits

Septenary433104base 7: 6 digits

Nonary124523base 9; each digit is two ternary digits: 6 digits

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

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

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

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

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

Bit-level

00000000000000010010011011111001

Bit length17 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits7within that length

Bit parityeven10 set bits, so even; not the same as the number itself being odd

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 26 f9

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

At each machine width

32-bit00000000000000010010011011111001

64-bit0000000000000000000000000000000000000000000000010010011011111001

One's complement11111111111111101101100100000110at 32 bits, every bit flipped

Bits reversed10011111011001001000000000000000at 32 bits

Rotated left by 100000000000000100100110111110010at 32 bits, wrapping

Shifted left by 1100100110111110010= 151,026, no wrap

Shifted right by 11001001101111100= 37,756, discarding the low bit

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

Nearest landmarks

Next prime75,521+8

Previous prime75,511−2

Distance to nearest prime2

Nearest square below75,076

Nearest square above75,625

Powers & multiples

75,513 to the power 25,702,213,169

75,513 to the power 3430,591,223,030,697

75,513 to the power 432,515,235,024,717,022,561

75,513 to the power 52,455,322,942,421,456,524,648,793

First ten multiples75,513, 151,026, 226,539, 302,052, 377,565, 453,078, 528,591, 604,104, 679,617, 755,130

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

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 9

Divisible by 12No, remainder 9

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 137the total stopping time

Highest value reached286,7203× the starting value

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

First steps75,513 → 226,540 → 113,270 → 56,635 → 169,906 → 84,953 → 254,860 → 127,430 → 63,715 → 191,146 → …

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

As a percentage & fraction

As a percentage7,551,300%

75,513% as a decimal755.13

75,513% of 10075,513

75,513% of 1,000755,130

As a fraction of 10075,513/100

Read another way

As seconds20 hours, 58 minutes and 33 seconds

As bytes73.743 KiB

As a 24-bit colour#0126F9

Keep nerding

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