Recognised as Number

12,215

Positive
Odd
Composite
5 digits

12,215 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 value12,215

Digit count5

Digit sum11

Digit product20

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 factorisation5 × 7 × 349

Distinct prime factors35, 7, 349

Number of divisors8

Sum of divisors σ(n)16,800

Aliquot sum4,585sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)348the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,352

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 7, 35, 349, 1,745, 2,443, 12,2158 in total

Arithmetic

Previous number12,214

Next number12,216

Double24,430

Half6,107.5

Square149,206,225

Cube1,822,554,038,375

Square root110.521491123≈irrational, shown to 9 decimal places

Cube root23.030206059≈

Negation-12,215

Reciprocal0.0000818666≈

Representations

Decimal12,215

Binary1011111011011114 bits

Octal27667

Hexadecimal2FB7

Base 369FB

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

In wordstwelve thousand, two hundred and fifteen

Ordinaltwelve thousand, two hundred and fifteenth

Scientific notation1.2215 × 10^4

Engineering notation12.215 × 10^3

In other bases

Ternary121202102base 3; the most digit-efficient integer base after e: 9 digits

Quinary342330base 5; one hand: 6 digits

Septenary50420base 7: 5 digits

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

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

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

Sexagesimal3:23:35base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0010111110110111

Bit length14 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits3within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes22f b7

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

At each machine width

16-bit0010111110110111

32-bit00000000000000000010111110110111

64-bit0000000000000000000000000000000000000000000000000010111110110111

One's complement1101000001001000at 16 bits, every bit flipped

Bits reversed1110110111110100at 16 bits

Rotated left by 10101111101101110at 16 bits, wrapping

Shifted left by 1101111101101110= 24,430, no wrap

Shifted right by 11011111011011= 6,107, discarding the low bit

These bits as a double6.03501186 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime12,227+12

Previous prime12,211−4

Distance to nearest prime4

Nearest square below12,100

Nearest square above12,321

Powers & multiples

12,215 to the power 2149,206,225

12,215 to the power 31,822,554,038,375

12,215 to the power 422,262,497,578,750,625

12,215 to the power 5271,936,407,924,438,884,375

First ten multiples12,215, 24,430, 36,645, 48,860, 61,075, 73,290, 85,505, 97,720, 109,935, 122,150

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 5

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 15

Collatz (3n + 1) trajectory

Steps to reach 1156the total stopping time

Highest value reached82,4566× the starting value

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

First steps12,215 → 36,646 → 18,323 → 54,970 → 27,485 → 82,456 → 41,228 → 20,614 → 10,307 → 30,922 → …

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

As a percentage & fraction

As a percentage1,221,500%

12,215% as a decimal122.15

12,215% of 10012,215

12,215% of 1,000122,150

As a fraction of 10012,215/100

Read another way

As seconds3 hours, 23 minutes and 35 seconds

As bytes11.929 KiB

As a 24-bit colour#002FB7

Keep nerding

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