Recognised as Number

1,213,555

Positive
Odd
Composite
7 digits

1,213,555 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,213,555

Digit count7

Digit sum22

Digit product750

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 7 × 34,673

Distinct prime factors35, 7, 34,673

Number of divisors8

Sum of divisors σ(n)1,664,352

Aliquot sum450,797sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)104,016the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 832,128

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 7, 35, 34,673, 173,365, 242,711, 1,213,5558 in total

Arithmetic

Previous number1,213,554

Next number1,213,556

Double2,427,110

Half606,777.5

Square1,472,715,738,025

Cube1,787,221,547,458,928,875

Square root1,101.614723939≈irrational, shown to 9 decimal places

Cube root106.664480207≈

Negation-1,213,555

Reciprocal8.24025281 × 10^-7≈

Representations

Decimal1,213,555

Binary10010100001000111001121 bits

Octal4502163

Hexadecimal128473

Base 36Q0DV

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

In wordsone million, two hundred and thirteen thousand, five hundred and fifty-five

Ordinalone million, two hundred and thirteen thousand, five hundred and fifty-fifth

Scientific notation1.213555 × 10^6

Engineering notation1.213555 × 10^6

In other bases

Ternary2021122200111base 3; the most digit-efficient integer base after e: 13 digits

Quinary302313210base 5; one hand: 9 digits

Septenary13213030base 7: 8 digits

Nonary2248614base 9; each digit is two ternary digits: 7 digits

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

Vigesimal7bdhfbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:37:5:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100101000010001110011

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes312 84 73

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

At each machine width

32-bit00000000000100101000010001110011

64-bit0000000000000000000000000000000000000000000100101000010001110011

One's complement11111111111011010111101110001100at 32 bits, every bit flipped

Bits reversed11001110001000010100100000000000at 32 bits

Rotated left by 100000000001001010000100011100110at 32 bits, wrapping

Shifted left by 11001010000100011100110= 2,427,110, no wrap

Shifted right by 110010100001000111001= 606,777, discarding the low bit

These bits as a double5.99575835 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,213,561+6

Previous prime1,213,547−8

Distance to nearest prime6

Nearest square below1,212,201

Nearest square above1,214,404

Powers & multiples

1,213,555 to the power 21,472,715,738,025

1,213,555 to the power 31,787,221,547,458,928,875

1,213,555 to the power 42,168,891,645,026,520,430,900,625

1,213,555 to the power 52,632,069,300,280,159,001,521,607,971,875

First ten multiples1,213,555, 2,427,110, 3,640,665, 4,854,220, 6,067,775, 7,281,330, 8,494,885, 9,708,440, 10,921,995, 12,135,550

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11No, remainder 2

Divisible by 12No, remainder 7

Divisible by 100No, remainder 55

Collatz (3n + 1) trajectory

Steps to reach 1266the total stopping time

Highest value reached24,909,92820× the starting value

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

First steps1,213,555 → 3,640,666 → 1,820,333 → 5,461,000 → 2,730,500 → 1,365,250 → 682,625 → 2,047,876 → 1,023,938 → 511,969 → …

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

As a percentage & fraction

As a percentage121,355,500%

1,213,555% as a decimal12,135.55

1,213,555% of 1001,213,555

1,213,555% of 1,00012,135,550

As a fraction of 1001,213,555/100

Read another way

As seconds14 days, 1 hour and 5 minutes

As bytes1.157 MiB

As a 24-bit colour#128473

Keep nerding

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