Recognised as Number
2,170,379
- Positive
- Odd
- Prime
- 7 digits
2,170,379 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,170,379
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,170,379
Distinct prime factors12,170,379
Number of divisors2
Sum of divisors σ(n)2,170,380
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,170,378integers below n that share no factor with it
Carmichael function λ(n)2,170,378the 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,170,3792 in total
Arithmetic
Previous number2,170,378
Next number2,170,380
Double4,340,758
Half1,085,189.5
Square4,710,545,003,641
Cube10,223,667,954,457,349,939
Square root1,473.220621631≈irrational, shown to 9 decimal places
Cube root129.472795824≈
Negation-2,170,379
Reciprocal4.60749021 × 10^-7≈
Representations
Decimal2,170,379
Binary100001000111100000101122 bits
Octal10217013
Hexadecimal211E0B
Base 361AIOB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and seventy thousand, three hundred and seventy-nine
Ordinaltwo million, one hundred and seventy thousand, three hundred and seventy-ninth
Scientific notation2.170379 × 10^6
Engineering notation2.170379 × 10^6
In other bases
Ternary11002021012102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1023423004base 5; one hand: 10 digits
Septenary24306431base 7: 8 digits
Nonary4067172base 9; each digit is two ternary digits: 7 digits
Duodecimal88800bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldb5ijbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:2:52:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1101T1T11TT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000010110001000011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010001111000001011
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
Bytes321 1e 0b
Gray code1100011001000100001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010001111000001011
64-bit0000000000000000000000000000000000000000001000010001111000001011
One's complement11111111110111101110000111110100at 32 bits, every bit flipped
Bits reversed11010000011110001000010000000000at 32 bits
Rotated left by 100000000010000100011110000010110at 32 bits, wrapping
Shifted left by 110000100011110000010110= 4,340,758, no wrap
Shifted right by 1100001000111100000101= 1,085,189, discarding the low bit
These bits as a double1.0723097 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,170,379 to the power 24,710,545,003,641
2,170,379 to the power 310,223,667,954,457,349,939
2,170,379 to the power 422,189,234,231,327,188,703,256,881
2,170,379 to the power 548,159,048,001,753,672,490,585,966,127,899
First ten multiples2,170,379, 4,340,758, 6,511,137, 8,681,516, 10,851,895, 13,022,274, 15,192,653, 17,363,032, 19,533,411, 21,703,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 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 165the total stopping time
Highest value reached9,766,7084× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,170,379 → 6,511,138 → 3,255,569 → 9,766,708 → 4,883,354 → 2,441,677 → 7,325,032 → 3,662,516 → 1,831,258 → 915,629 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage217,037,900%
2,170,379% as a decimal21,703.79
2,170,379% of 1002,170,379
2,170,379% of 1,00021,703,790
As a fraction of 1002,170,379/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,170,379
Nerdulate something else
Nothing in mind? Surprise me · today’s page