Recognised as Number
2,100,529
- Positive
- Odd
- Composite
- 7 digits
2,100,529 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,100,529
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation31 × 67,759
Distinct prime factors231, 67,759
Number of divisors4
Sum of divisors σ(n)2,168,320
Aliquot sum67,791sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,032,740integers below n that share no factor with it
Carmichael function λ(n)338,790the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,032,740
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 31, 67,759, 2,100,5294 in total
Arithmetic
Previous number2,100,528
Next number2,100,530
Double4,201,058
Half1,050,264.5
Square4,412,222,079,841
Cube9,268,000,433,146,335,889
Square root1,449.320185466≈irrational, shown to 9 decimal places
Cube root128.068668396≈
Negation-2,100,529
Reciprocal4.76070552 × 10^-7≈
Representations
Decimal2,100,529
Binary100000000011010011000122 bits
Octal10006461
Hexadecimal200D31
Base 36190S1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred thousand, five hundred and twenty-nine
Ordinaltwo million, one hundred thousand, five hundred and twenty-ninth
Scientific notation2.100529 × 10^6
Engineering notation2.100529 × 10^6
In other bases
Ternary10221201101101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1014204104base 5; one hand: 10 digits
Septenary23565664base 7: 8 digits
Nonary3851341base 9; each digit is two ternary digits: 7 digits
Duodecimal853701base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald2b69base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:43:28:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1100TT01101101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000001110101110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000000110100110001
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 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
Bytes320 0d 31
Gray code1100000000101110101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000000110100110001
64-bit0000000000000000000000000000000000000000001000000000110100110001
One's complement11111111110111111111001011001110at 32 bits, every bit flipped
Bits reversed10001100101100000000010000000000at 32 bits
Rotated left by 100000000010000000001101001100010at 32 bits, wrapping
Shifted left by 110000000001101001100010= 4,201,058, no wrap
Shifted right by 1100000000011010011000= 1,050,264, discarding the low bit
These bits as a double1.03779922 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,100,529 to the power 24,412,222,079,841
2,100,529 to the power 39,268,000,433,146,335,889
2,100,529 to the power 419,467,703,681,836,439,778,585,281
2,100,529 to the power 540,892,476,147,104,215,011,671,961,713,649
First ten multiples2,100,529, 4,201,058, 6,301,587, 8,402,116, 10,502,645, 12,603,174, 14,703,703, 16,804,232, 18,904,761, 21,005,290
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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 191the total stopping time
Highest value reached6,301,5883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,100,529 → 6,301,588 → 3,150,794 → 1,575,397 → 4,726,192 → 2,363,096 → 1,181,548 → 590,774 → 295,387 → 886,162 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage210,052,900%
2,100,529% as a decimal21,005.29
2,100,529% of 1002,100,529
2,100,529% of 1,00021,005,290
As a fraction of 1002,100,529/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,100,529
Nerdulate something else
Nothing in mind? Surprise me · today’s page