Recognised as Number

40,215

Positive
Odd
Composite
5 digits

40,215 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value40,215

Digit count5

Digit sum12

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 7 × 383

Distinct prime factors43, 5, 7, 383

Number of divisors16

Sum of divisors σ(n)73,728

Aliquot sum33,513sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,292the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,336

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 7, 15, 21, 35, 105, 383, 1,149, 1,915, 2,681, 5,745, 8,043, 13,405, 40,21516 in total

Arithmetic

Previous number40,214

Next number40,216

Double80,430

Half20,107.5

Square1,617,246,225

Cube65,037,556,938,375

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

Cube root34.260683615≈

Negation-40,215

Reciprocal0.0000248663≈

Representations

Decimal40,215

Binary100111010001011116 bits

Octal116427

Hexadecimal9D17

Base 36V13

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

In wordsforty thousand, two hundred and fifteen

Ordinalforty thousand, two hundred and fifteenth

Scientific notation4.0215 × 10^4

Engineering notation40.215 × 10^3

In other bases

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

Quinary2241330base 5; one hand: 7 digits

Septenary225150base 7: 6 digits

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

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

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

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

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

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

Bit-level

1001110100010111

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 set bits, so odd; 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 17

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

At each machine width

16-bit1001110100010111

32-bit00000000000000001001110100010111

64-bit0000000000000000000000000000000000000000000000001001110100010111

One's complement0110001011101000at 16 bits, every bit flipped

Bits reversed1110100010111001at 16 bits

Rotated left by 10011101000101111at 16 bits, wrapping

Shifted left by 110011101000101110= 80,430, no wrap

Shifted right by 1100111010001011= 20,107, discarding the low bit

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

Nearest landmarks

Next prime40,231+16

Previous prime40,213−2

Distance to nearest prime2

Nearest square below40,000

Nearest square above40,401

Powers & multiples

40,215 to the power 21,617,246,225

40,215 to the power 365,037,556,938,375

40,215 to the power 42,615,485,352,276,750,625

40,215 to the power 5105,181,743,441,809,526,384,375

First ten multiples40,215, 80,430, 120,645, 160,860, 201,075, 241,290, 281,505, 321,720, 361,935, 402,150

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 3

Divisible by 5Yes

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 5

Divisible by 11No, remainder 10

Divisible by 12No, remainder 3

Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 1119the total stopping time

Highest value reached271,4566× the starting value

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

First steps40,215 → 120,646 → 60,323 → 180,970 → 90,485 → 271,456 → 135,728 → 67,864 → 33,932 → 16,966 → …

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

As a percentage & fraction

As a percentage4,021,500%

40,215% as a decimal402.15

40,215% of 10040,215

40,215% of 1,000402,150

As a fraction of 10040,215/100

Read another way

As seconds11 hours, 10 minutes and 15 seconds

As bytes39.272 KiB

As a 24-bit colour#009D17

Keep nerding

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