Recognised as Number

62,213

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value62,213

Digit count5

Digit sum14

Digit product72

Multiplicative persistence3times 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 factorisation62,213

Distinct prime factors162,213

Number of divisors2

Sum of divisors σ(n)62,214

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)62,212the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 62,2132 in total

Arithmetic

Previous number62,212

Next number62,214

Double124,426

Half31,106.5

Square3,870,457,369

Cube240,792,764,297,597

Square root249.425339531≈irrational, shown to 9 decimal places

Cube root39.624188535≈

Negation-62,213

Reciprocal0.0000160738≈

Representations

Decimal62,213

Binary111100110000010116 bits

Octal171405

HexadecimalF305

Base 361C05

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

In wordssixty-two thousand, two hundred and thirteen

Ordinalsixty-two thousand, two hundred and thirteenth

Scientific notation6.2213 × 10^4

Engineering notation62.213 × 10^3

In other bases

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

Quinary3442323base 5; one hand: 7 digits

Septenary346244base 7: 6 digits

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

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

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

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

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

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

Bit-level

1111001100000101

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

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

Bytes2f3 05

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

At each machine width

16-bit1111001100000101

32-bit00000000000000001111001100000101

64-bit0000000000000000000000000000000000000000000000001111001100000101

One's complement0000110011111010at 16 bits, every bit flipped

Bits reversed1010000011001111at 16 bits

Rotated left by 11110011000001011at 16 bits, wrapping

Shifted left by 111110011000001010= 124,426, no wrap

Shifted right by 1111100110000010= 31,106, discarding the low bit

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

Nearest landmarks

Next prime62,219+6

Previous prime62,207−6

Distance to nearest prime0, it is prime

Nearest square below62,001

Nearest square above62,500

Powers & multiples

62,213 to the power 23,870,457,369

62,213 to the power 3240,792,764,297,597

62,213 to the power 414,980,440,245,246,402,161

62,213 to the power 5931,978,128,977,514,417,642,293

First ten multiples62,213, 124,426, 186,639, 248,852, 311,065, 373,278, 435,491, 497,704, 559,917, 622,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 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time

Highest value reached186,6403× the starting value

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

First steps62,213 → 186,640 → 93,320 → 46,660 → 23,330 → 11,665 → 34,996 → 17,498 → 8,749 → 26,248 → …

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

As a percentage & fraction

As a percentage6,221,300%

62,213% as a decimal622.13

62,213% of 10062,213

62,213% of 1,000622,130

As a fraction of 10062,213/100

Read another way

As seconds17 hours, 16 minutes and 53 seconds

As bytes60.755 KiB

As a 24-bit colour#00F305

Keep nerding

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