Recognised as Number
2,170,361
- Positive
- Odd
- Prime
- 7 digits
2,170,361 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,361
Digit count7
Digit sum20
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,361
Distinct prime factors12,170,361
Number of divisors2
Sum of divisors σ(n)2,170,362
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,170,360integers below n that share no factor with it
Carmichael function λ(n)2,170,360the 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,3612 in total
Arithmetic
Previous number2,170,360
Next number2,170,362
Double4,340,722
Half1,085,180.5
Square4,710,466,870,321
Cube10,223,413,587,136,755,881
Square root1,473.214512554≈irrational, shown to 9 decimal places
Cube root129.472437896≈
Negation-2,170,361
Reciprocal4.60752842 × 10^-7≈
Representations
Decimal2,170,361
Binary100001000111011111100122 bits
Octal10216771
Hexadecimal211DF9
Base 361AINT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and seventy thousand, three hundred and sixty-one
Ordinaltwo million, one hundred and seventy thousand, three hundred and sixty-first
Scientific notation2.170361 × 10^6
Engineering notation2.170361 × 10^6
In other bases
Ternary11002021011202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1023422421base 5; one hand: 10 digits
Septenary24306404base 7: 8 digits
Nonary4067152base 9; each digit is two ternary digits: 7 digits
Duodecimal887bb5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldb5i1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:2:52:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1101T1T11TTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000010110001000001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010001110111111001
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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 f9
Gray code1100011001001100000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010001110111111001
64-bit0000000000000000000000000000000000000000001000010001110111111001
One's complement11111111110111101110001000000110at 32 bits, every bit flipped
Bits reversed10011111101110001000010000000000at 32 bits
Rotated left by 100000000010000100011101111110010at 32 bits, wrapping
Shifted left by 110000100011101111110010= 4,340,722, no wrap
Shifted right by 1100001000111011111100= 1,085,180, discarding the low bit
These bits as a double1.07230081 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,170,361 to the power 24,710,466,870,321
2,170,361 to the power 310,223,413,587,136,755,881
2,170,361 to the power 422,188,498,136,391,716,630,643,041
2,170,361 to the power 548,157,051,003,797,262,498,199,061,107,801
First ten multiples2,170,361, 4,340,722, 6,511,083, 8,681,444, 10,851,805, 13,022,166, 15,192,527, 17,362,888, 19,533,249, 21,703,610
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1166the total stopping time
Highest value reached8,240,5963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,170,361 → 6,511,084 → 3,255,542 → 1,627,771 → 4,883,314 → 2,441,657 → 7,324,972 → 3,662,486 → 1,831,243 → 5,493,730 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage217,036,100%
2,170,361% as a decimal21,703.61
2,170,361% of 1002,170,361
2,170,361% of 1,00021,703,610
As a fraction of 1002,170,361/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,361
Nerdulate something else
Nothing in mind? Surprise me · today’s page