Recognised as Number
2,184,967
- Positive
- Odd
- Prime
- 7 digits
2,184,967 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,184,967
Digit count7
Digit sum37
Digit product24,192
Multiplicative persistence4times 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 factorisation2,184,967
Distinct prime factors12,184,967
Number of divisors2
Sum of divisors σ(n)2,184,968
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,184,966integers below n that share no factor with it
Carmichael function λ(n)2,184,966the 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,184,9672 in total
Arithmetic
Previous number2,184,966
Next number2,184,968
Double4,369,934
Half1,092,483.5
Square4,774,080,791,089
Cube10,431,208,983,863,359,063
Square root1,478.163387451≈irrational, shown to 9 decimal places
Cube root129.762228099≈
Negation-2,184,967
Reciprocal4.57672816 × 10^-7≈
Representations
Decimal2,184,967
Binary100001010101110000011122 bits
Octal10253407
Hexadecimal215707
Base 361ATXJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and eighty-four thousand, nine hundred and sixty-seven
Ordinaltwo million, one hundred and eighty-four thousand, nine hundred and sixty-seventh
Scientific notation2.184967 × 10^6
Engineering notation2.184967 × 10^6
In other bases
Ternary11010000012201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1024404332base 5; one hand: 10 digits
Septenary24400111base 7: 8 digits
Nonary4100181base 9; each digit is two ternary digits: 7 digits
Duodecimal894547base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldd287base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:6:56:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110100001T0T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101010101100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010101011100000111
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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 57 07
Gray code1100011111110010000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010101011100000111
64-bit0000000000000000000000000000000000000000001000010101011100000111
One's complement11111111110111101010100011111000at 32 bits, every bit flipped
Bits reversed11100000111010101000010000000000at 32 bits
Rotated left by 100000000010000101010111000001110at 32 bits, wrapping
Shifted left by 110000101010111000001110= 4,369,934, no wrap
Shifted right by 1100001010101110000011= 1,092,483, discarding the low bit
These bits as a double1.07951713 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,184,967 to the power 24,774,080,791,089
2,184,967 to the power 310,431,208,983,863,359,063
2,184,967 to the power 422,791,847,399,844,972,061,805,921
2,184,967 to the power 549,799,434,437,697,069,070,967,897,789,607
First ten multiples2,184,967, 4,369,934, 6,554,901, 8,739,868, 10,924,835, 13,109,802, 15,294,769, 17,479,736, 19,664,703, 21,849,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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1285the total stopping time
Highest value reached215,520,10098× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,184,967 → 6,554,902 → 3,277,451 → 9,832,354 → 4,916,177 → 14,748,532 → 7,374,266 → 3,687,133 → 11,061,400 → 5,530,700 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage218,496,700%
2,184,967% as a decimal21,849.67
2,184,967% of 1002,184,967
2,184,967% of 1,00021,849,670
As a fraction of 1002,184,967/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,184,967
Nerdulate something else
Nothing in mind? Surprise me · today’s page