Recognised as Number

2,211,169

Positive
Odd
Composite
Perfect square
7 digits

2,211,169 is an odd 7-digit integer and a composite number. It has 3 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value2,211,169

Digit count7

Digit sum22

Digit product216

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,487²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,487^2

Distinct prime factors11,487

Number of divisors3

Sum of divisors σ(n)2,212,657

Aliquot sum1,488sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,209,682integers below n that share no factor with it

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

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 1,487, 2,211,1693 in total

Arithmetic

Previous number2,211,168

Next number2,211,170

Double4,422,338

Half1,105,584.5

Square4,889,268,346,561

Cube10,810,998,600,596,939,809

Square root1,487exact

Cube root130.278868814≈

Negation-2,211,169

Reciprocal4.52249466 × 10^-7≈

Representations

Decimal2,211,169

Binary100001101111010110000122 bits

Octal10336541

Hexadecimal21BD61

Base 361BE5D

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

In wordstwo million, two hundred and eleven thousand, one hundred and sixty-nine

Ordinaltwo million, two hundred and eleven thousand, one hundred and sixty-ninth

Scientific notation2.211169 × 10^6

Engineering notation2.211169 × 10^6

In other bases

Ternary11011100011011base 3; the most digit-efficient integer base after e: 14 digits

Quinary1031224134base 5; one hand: 10 digits

Septenary24536362base 7: 8 digits

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

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

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

Sexagesimal10:14:12:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001000011011110101100001

Bit length22 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits11within that length

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

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes321 bd 61

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

At each machine width

32-bit00000000001000011011110101100001

64-bit0000000000000000000000000000000000000000001000011011110101100001

One's complement11111111110111100100001010011110at 32 bits, every bit flipped

Bits reversed10000110101111011000010000000000at 32 bits

Rotated left by 100000000010000110111101011000010at 32 bits, wrapping

Shifted left by 110000110111101011000010= 4,422,338, no wrap

Shifted right by 1100001101111010110000= 1,105,584, discarding the low bit

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

Nearest landmarks

Next prime2,211,179+10

Previous prime2,211,161−8

Distance to nearest prime8

Nearest square below2,211,169

Nearest square above2,214,144

Powers & multiples

2,211,169 to the power 24,889,268,346,561

2,211,169 to the power 310,810,998,600,596,939,809

2,211,169 to the power 423,904,944,964,683,334,800,526,721

2,211,169 to the power 552,857,873,252,613,884,727,545,869,146,849

First ten multiples2,211,169, 4,422,338, 6,633,507, 8,844,676, 11,055,845, 13,267,014, 15,478,183, 17,689,352, 19,900,521, 22,111,690

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time

Highest value reached8,395,5403× the starting value

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

First steps2,211,169 → 6,633,508 → 3,316,754 → 1,658,377 → 4,975,132 → 2,487,566 → 1,243,783 → 3,731,350 → 1,865,675 → 5,597,026 → …

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

As a percentage & fraction

As a percentage221,116,900%

2,211,169% as a decimal22,111.69

2,211,169% of 1002,211,169

2,211,169% of 1,00022,111,690

As a fraction of 1002,211,169/100

Read another way

As seconds25 days, 14 hours and 12 minutes

As bytes2.109 MiB

As a 24-bit colour#21BD61

Keep nerding

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