Recognised as Number
2,170,367
- Positive
- Odd
- Composite
- 7 digits
2,170,367 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,170,367
Digit count7
Digit sum26
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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation79 × 83 × 331
Distinct prime factors379, 83, 331
Number of divisors8
Sum of divisors σ(n)2,231,040
Aliquot sum60,673sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,110,680integers below n that share no factor with it
Carmichael function λ(n)175,890the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,110,680
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 79, 83, 331, 6,557, 26,149, 27,473, 2,170,3678 in total
Arithmetic
Previous number2,170,366
Next number2,170,368
Double4,340,734
Half1,085,183.5
Square4,710,492,914,689
Cube10,223,498,375,774,820,863
Square root1,473.216548916≈irrational, shown to 9 decimal places
Cube root129.472557206≈
Negation-2,170,367
Reciprocal4.60751569 × 10^-7≈
Representations
Decimal2,170,367
Binary100001000111011111111122 bits
Octal10216777
Hexadecimal211DFF
Base 361AINZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and seventy thousand, three hundred and sixty-seven
Ordinaltwo million, one hundred and seventy thousand, three hundred and sixty-seventh
Scientific notation2.170367 × 10^6
Engineering notation2.170367 × 10^6
In other bases
Ternary11002021011222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1023422432base 5; one hand: 10 digits
Septenary24306413base 7: 8 digits
Nonary4067158base 9; each digit is two ternary digits: 7 digits
Duodecimal887bbbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldb5i7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:2:52:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1101T1T11TT00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000010110001000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010001110111111111
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; 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 1d ff
Gray code1100011001001100000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010001110111111111
64-bit0000000000000000000000000000000000000000001000010001110111111111
One's complement11111111110111101110001000000000at 32 bits, every bit flipped
Bits reversed11111111101110001000010000000000at 32 bits
Rotated left by 100000000010000100011101111111110at 32 bits, wrapping
Shifted left by 110000100011101111111110= 4,340,734, no wrap
Shifted right by 1100001000111011111111= 1,085,183, discarding the low bit
These bits as a double1.07230377 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,170,367 to the power 24,710,492,914,689
2,170,367 to the power 310,223,498,375,774,820,863
2,170,367 to the power 422,188,743,499,335,270,631,966,721
2,170,367 to the power 548,157,716,662,421,793,315,689,716,356,607
First ten multiples2,170,367, 4,340,734, 6,511,101, 8,681,468, 10,851,835, 13,022,202, 15,192,569, 17,362,936, 19,533,303, 21,703,670
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1223the total stopping time
Highest value reached166,872,47276× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,170,367 → 6,511,102 → 3,255,551 → 9,766,654 → 4,883,327 → 14,649,982 → 7,324,991 → 21,974,974 → 10,987,487 → 32,962,462 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage217,036,700%
2,170,367% as a decimal21,703.67
2,170,367% of 1002,170,367
2,170,367% of 1,00021,703,670
As a fraction of 1002,170,367/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,367
Nerdulate something else
Nothing in mind? Surprise me · today’s page