Recognised as Number
2,106,479
- Positive
- Odd
- Prime
- 7 digits
2,106,479 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,106,479
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,106,479
Distinct prime factors12,106,479
Number of divisors2
Sum of divisors σ(n)2,106,480
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,106,478integers below n that share no factor with it
Carmichael function λ(n)2,106,478the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2,106,4792 in total
Arithmetic
Previous number2,106,478
Next number2,106,480
Double4,212,958
Half1,053,239.5
Square4,437,253,777,441
Cube9,346,981,899,850,140,239
Square root1,451.371420416≈irrational, shown to 9 decimal places
Cube root128.18947768≈
Negation-2,106,479
Reciprocal4.74725834 × 10^-7≈
Representations
Decimal2,106,479
Binary100000001001000110111122 bits
Octal10022157
Hexadecimal20246F
Base 36195DB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and six thousand, four hundred and seventy-nine
Ordinaltwo million, one hundred and six thousand, four hundred and seventy-ninth
Scientific notation2.106479 × 10^6
Engineering notation2.106479 × 10^6
In other bases
Ternary10222000112202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1014401404base 5; one hand: 10 digits
Septenary23622224base 7: 8 digits
Nonary3860482base 9; each digit is two ternary digits: 7 digits
Duodecimal85703bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald363jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:45:7:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1100T001TT0T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000110010110110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000010010001101111
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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 24 6f
Gray code1100000011011001011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000010010001101111
64-bit0000000000000000000000000000000000000000001000000010010001101111
One's complement11111111110111111101101110010000at 32 bits, every bit flipped
Bits reversed11110110001001000000010000000000at 32 bits
Rotated left by 100000000010000000100100011011110at 32 bits, wrapping
Shifted left by 110000000100100011011110= 4,212,958, no wrap
Shifted right by 1100000001001000110111= 1,053,239, discarding the low bit
These bits as a double1.04073891 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,106,479 to the power 24,437,253,777,441
2,106,479 to the power 39,346,981,899,850,140,239
2,106,479 to the power 419,689,221,085,414,423,560,508,481
2,106,479 to the power 541,474,930,742,782,689,527,316,344,548,399
First ten multiples2,106,479, 4,212,958, 6,319,437, 8,425,916, 10,532,395, 12,638,874, 14,745,353, 16,851,832, 18,958,311, 21,064,790
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1272the total stopping time
Highest value reached32,428,67215× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,106,479 → 6,319,438 → 3,159,719 → 9,479,158 → 4,739,579 → 14,218,738 → 7,109,369 → 21,328,108 → 10,664,054 → 5,332,027 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage210,647,900%
2,106,479% as a decimal21,064.79
2,106,479% of 1002,106,479
2,106,479% of 1,00021,064,790
As a fraction of 1002,106,479/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,106,479
Nerdulate something else
Nothing in mind? Surprise me · today’s page