Recognised as Number

40,213

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value40,213

Digit count5

Digit sum10

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation40,213

Distinct prime factors140,213

Number of divisors2

Sum of divisors σ(n)40,214

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)40,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, 40,2132 in total

Arithmetic

Previous number40,212

Next number40,214

Double80,426

Half20,106.5

Square1,617,085,369

Cube65,027,853,943,597

Square root200.531792991≈irrational, shown to 9 decimal places

Cube root34.260115647≈

Negation-40,213

Reciprocal0.0000248676≈

Representations

Decimal40,213

Binary100111010001010116 bits

Octal116425

Hexadecimal9D15

Base 36V11

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

In wordsforty thousand, two hundred and thirteen

Ordinalforty thousand, two hundred and thirteenth

Scientific notation4.0213 × 10^4

Engineering notation40.213 × 10^3

In other bases

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

Quinary2241323base 5; one hand: 7 digits

Septenary225145base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001110100010101

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

Bytes29d 15

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

At each machine width

16-bit1001110100010101

32-bit00000000000000001001110100010101

64-bit0000000000000000000000000000000000000000000000001001110100010101

One's complement0110001011101010at 16 bits, every bit flipped

Bits reversed1010100010111001at 16 bits

Rotated left by 10011101000101011at 16 bits, wrapping

Shifted left by 110011101000101010= 80,426, no wrap

Shifted right by 1100111010001010= 20,106, discarding the low bit

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

Nearest landmarks

Next prime40,231+18

Previous prime40,193−20

Distance to nearest prime0, it is prime

Nearest square below40,000

Nearest square above40,401

Powers & multiples

40,213 to the power 21,617,085,369

40,213 to the power 365,027,853,943,597

40,213 to the power 42,614,965,090,633,866,161

40,213 to the power 5105,155,591,189,659,659,932,293

First ten multiples40,213, 80,426, 120,639, 160,852, 201,065, 241,278, 281,491, 321,704, 361,917, 402,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 1

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached120,6403× the starting value

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

First steps40,213 → 120,640 → 60,320 → 30,160 → 15,080 → 7,540 → 3,770 → 1,885 → 5,656 → 2,828 → …

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

As a percentage & fraction

As a percentage4,021,300%

40,213% as a decimal402.13

40,213% of 10040,213

40,213% of 1,000402,130

As a fraction of 10040,213/100

Read another way

As seconds11 hours, 10 minutes and 13 seconds

As bytes39.271 KiB

As a 24-bit colour#009D15

Keep nerding

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