Recognised as Number

2,155,022

Positive
Even
Composite
7 digits

2,155,022 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value2,155,022

Digit count7

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 17 × 241 × 263

Distinct prime factors42, 17, 241, 263

Number of divisors16

Sum of divisors σ(n)3,449,952

Aliquot sum1,294,930sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,006,080integers below n that share no factor with it

Carmichael function λ(n)31,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,006,080

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 17, 34, 241, 263, 482, 526, 4,097, 4,471, 8,194, 8,942, 63,383, 126,766, 1,077,511, 2,155,02216 in total

Arithmetic

Previous number2,155,021

Next number2,155,023

Double4,310,044

Half1,077,511

Square4,644,119,820,484

Cube10,008,180,383,779,070,648

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

Cube root129.166701538≈

Negation-2,155,022

Reciprocal4.64032386 × 10^-7≈

Representations

Decimal2,155,022

Binary100000111000100000111022 bits

Octal10161016

Hexadecimal20E20E

Base 361A6TQ

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

In wordstwo million, one hundred and fifty-five thousand and twenty-two

Ordinaltwo million, one hundred and fifty-five thousand and twenty-second

Scientific notation2.155022 × 10^6

Engineering notation2.155022 × 10^6

In other bases

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

Quinary1022430042base 5; one hand: 10 digits

Septenary24213602base 7: 8 digits

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

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

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

Sexagesimal9:58:37:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001000001110001000001110

Bit length22 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits14within that length

Bit parityeven8 set bits, so even; not the same as the number itself being even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes320 e2 0e

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

At each machine width

32-bit00000000001000001110001000001110

64-bit0000000000000000000000000000000000000000001000001110001000001110

One's complement11111111110111110001110111110001at 32 bits, every bit flipped

Bits reversed01110000010001110000010000000000at 32 bits

Rotated left by 100000000010000011100010000011100at 32 bits, wrapping

Shifted left by 110000011100010000011100= 4,310,044, no wrap

Shifted right by 1100000111000100000111= 1,077,511, discarding the low bit

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

Nearest landmarks

Next prime2,155,057+35

Previous prime2,155,009−13

Distance to nearest prime13

Nearest square below2,152,089

Nearest square above2,155,024

Powers & multiples

2,155,022 to the power 24,644,119,820,484

2,155,022 to the power 310,008,180,383,779,070,648

2,155,022 to the power 421,567,848,907,012,340,385,994,256

2,155,022 to the power 546,479,188,887,287,547,803,306,113,553,632

First ten multiples2,155,022, 4,310,044, 6,465,066, 8,620,088, 10,775,110, 12,930,132, 15,085,154, 17,240,176, 19,395,198, 21,550,220

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 2

Divisible by 8No, remainder 6

Divisible by 9No, remainder 8

Divisible by 10No, remainder 2

Divisible by 11No, remainder 1

Divisible by 12No, remainder 2

Divisible by 100No, remainder 22

Collatz (3n + 1) trajectory

Steps to reach 1210the total stopping time

Highest value reached7,273,2043× the starting value

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

First steps2,155,022 → 1,077,511 → 3,232,534 → 1,616,267 → 4,848,802 → 2,424,401 → 7,273,204 → 3,636,602 → 1,818,301 → 5,454,904 → …

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

As a percentage & fraction

As a percentage215,502,200%

2,155,022% as a decimal21,550.22

2,155,022% of 1002,155,022

2,155,022% of 1,00021,550,220

As a fraction of 1002,155,022/100

Read another way

As seconds24 days, 22 hours and 37 minutes

As bytes2.055 MiB

As a 24-bit colour#20E20E

Keep nerding

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