Recognised as Number

59,213

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value59,213

Digit count5

Digit sum20

Digit product270

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 11 × 769

Distinct prime factors37, 11, 769

Number of divisors8

Sum of divisors σ(n)73,920

Aliquot sum14,707sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 11, 77, 769, 5,383, 8,459, 59,2138 in total

Arithmetic

Previous number59,212

Next number59,214

Double118,426

Half29,606.5

Square3,506,179,369

Cube207,611,398,976,597

Square root243.337214581≈irrational, shown to 9 decimal places

Cube root38.976755818≈

Negation-59,213

Reciprocal0.0000168882≈

Representations

Decimal59,213

Binary111001110100110116 bits

Octal163515

HexadecimalE74D

Base 3619OT

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

In wordsfifty-nine thousand, two hundred and thirteen

Ordinalfifty-nine thousand, two hundred and thirteenth

Scientific notation5.9213 × 10^4

Engineering notation59.213 × 10^3

In other bases

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

Quinary3343323base 5; one hand: 7 digits

Septenary334430base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110011101001101

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Bytes2e7 4d

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

At each machine width

16-bit1110011101001101

32-bit00000000000000001110011101001101

64-bit0000000000000000000000000000000000000000000000001110011101001101

One's complement0001100010110010at 16 bits, every bit flipped

Bits reversed1011001011100111at 16 bits

Rotated left by 11100111010011011at 16 bits, wrapping

Shifted left by 111100111010011010= 118,426, no wrap

Shifted right by 1111001110100110= 29,606, discarding the low bit

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

Nearest landmarks

Next prime59,219+6

Previous prime59,209−4

Distance to nearest prime4

Nearest square below59,049

Nearest square above59,536

Powers & multiples

59,213 to the power 23,506,179,369

59,213 to the power 3207,611,398,976,597

59,213 to the power 412,293,293,767,601,238,161

59,213 to the power 5727,922,803,860,972,115,227,293

First ten multiples59,213, 118,426, 177,639, 236,852, 296,065, 355,278, 414,491, 473,704, 532,917, 592,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 3

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time

Highest value reached177,6403× the starting value

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

First steps59,213 → 177,640 → 88,820 → 44,410 → 22,205 → 66,616 → 33,308 → 16,654 → 8,327 → 24,982 → …

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

As a percentage & fraction

As a percentage5,921,300%

59,213% as a decimal592.13

59,213% of 10059,213

59,213% of 1,000592,130

As a fraction of 10059,213/100

Read another way

As seconds16 hours, 26 minutes and 53 seconds

As bytes57.825 KiB

As a 24-bit colour#00E74D

Keep nerding

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