Recognised as Number
2,102,272
- Positive
- Even
- Composite
- 7 digits
2,102,272 is an even 7-digit integer and a composite number. It has 22 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,102,272
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^10 × 2,053
Distinct prime factors22, 2,053
Number of divisors22
Sum of divisors σ(n)4,204,538
Aliquot sum2,102,266sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,050,624integers below n that share no factor with it
Carmichael function λ(n)131,328the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,050,624
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1,024, 2,053, 4,106, 8,212, 16,424, 32,848, 65,696, 131,392, 262,784, 525,568, 1,051,136, 2,102,27222 in total
Arithmetic
Previous number2,102,271
Next number2,102,273
Double4,204,544
Half1,051,136
Square4,419,547,561,984
Cube9,291,091,092,227,227,648
Square root1,449.921377179≈irrational, shown to 9 decimal places
Cube root128.10408201≈
Negation-2,102,272
Reciprocal4.7567584 × 10^-7≈
Representations
Decimal2,102,272
Binary100000000101000000000022 bits
Octal10012000
Hexadecimal201400
Base 361924G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and two thousand, two hundred and seventy-two
Ordinaltwo million, one hundred and two thousand, two hundred and seventy-second
Scientific notation2.102272 × 10^6
Engineering notation2.102272 × 10^6
In other bases
Ternary10221210202221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1014233042base 5; one hand: 10 digits
Septenary23604034base 7: 8 digits
Nonary3853687base 9; each digit is two ternary digits: 7 digits
Duodecimal854714base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald2fdcbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:43:57:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1100TT11T100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000001010000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000001010000000000
Bit length22 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits19within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 1010 trailing zeros
Power of twoNo
Bytes320 14 00
Gray code1100000001111000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000001010000000000
64-bit0000000000000000000000000000000000000000001000000001010000000000
One's complement11111111110111111110101111111111at 32 bits, every bit flipped
Bits reversed00000000001010000000010000000000at 32 bits
Rotated left by 100000000010000000010100000000000at 32 bits, wrapping
Shifted left by 110000000010100000000000= 4,204,544, no wrap
Shifted right by 1100000000101000000000= 1,051,136, discarding the low bit
These bits as a double1.03866037 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,102,272 to the power 24,419,547,561,984
2,102,272 to the power 39,291,091,092,227,227,648
2,102,272 to the power 419,532,400,652,638,718,322,016,256
2,102,272 to the power 541,062,418,984,824,103,644,261,758,533,632
First ten multiples2,102,272, 4,204,544, 6,306,816, 8,409,088, 10,511,360, 12,613,632, 14,715,904, 16,818,176, 18,920,448, 21,022,720
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 7
Divisible by 12No, remainder 4
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 147the total stopping time
Highest value reached2,102,272
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,102,272 → 1,051,136 → 525,568 → 262,784 → 131,392 → 65,696 → 32,848 → 16,424 → 8,212 → 4,106 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage210,227,200%
2,102,272% as a decimal21,022.72
2,102,272% of 1002,102,272
2,102,272% of 1,00021,022,720
As a fraction of 1002,102,272/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 2,102,272
Nerdulate something else
Nothing in mind? Surprise me · today’s page