Nerdulator> put something in

Recognised as Number

2,131,979

  • Positive
  • Odd
  • Prime
  • 7 digits

2,131,979 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,131,979
Digit count7
Digit sum32
Digit product3,402
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2,131,979
Distinct prime factors12,131,979
Number of divisors2
Sum of divisors σ(n)2,131,980
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,131,978integers below n that share no factor with it
Carmichael function λ(n)2,131,978the 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,131,9792 in total

Arithmetic

Previous number2,131,978
Next number2,131,980
Double4,263,958
Cube9,690,557,609,108,626,739
Square root1,460.129788752≈irrational, shown to 9 decimal places
Cube root128.704670629≈
Negation-2,131,979
Reciprocal4.69047772 × 10^-7≈

Representations

Decimal2,131,979
Binary100000100010000000101122 bits
Octal10104013
Hexadecimal20880B
Base 3619P1N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and thirty-one thousand, nine hundred and seventy-nine
Ordinaltwo million, one hundred and thirty-one thousand, nine hundred and seventy-ninth
Scientific notation2.131979 × 10^6
Engineering notation2.131979 × 10^6

In other bases

Ternary11000022112012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1021210404base 5; one hand: 10 digits
Septenary24056453base 7: 8 digits
Nonary4008465base 9; each digit is two ternary digits: 7 digits
Duodecimal86994bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald69ijbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:52:12:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11000100TTT1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011001100000011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000001000100000001011
Bit length22 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits16within that length
Bit parityeven6 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
Bytes320 88 0b
Gray code1100001100110000001110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000001000100000001011
64-bit0000000000000000000000000000000000000000001000001000100000001011
One's complement11111111110111110111011111110100at 32 bits, every bit flipped
Bits reversed11010000000100010000010000000000at 32 bits
Rotated left by 100000000010000010001000000010110at 32 bits, wrapping
Shifted left by 110000010001000000010110= 4,263,958, no wrap
Shifted right by 1100000100010000000101= 1,065,989, discarding the low bit
These bits as a double1.05333758 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,131,981+2
Previous prime2,131,951−28
Distance to nearest prime0, it is prime
Nearest square below2,131,600
Nearest square above2,134,521

Powers & multiples

2,131,979 to the power 24,545,334,456,441
2,131,979 to the power 39,690,557,609,108,626,739
2,131,979 to the power 420,660,065,320,909,800,926,386,481
2,131,979 to the power 544,046,825,402,807,956,469,236,523,375,899
First ten multiples2,131,979, 4,263,958, 6,395,937, 8,527,916, 10,659,895, 12,791,874, 14,923,853, 17,055,832, 19,187,811, 21,319,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 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 1148the total stopping time
Highest value reached9,593,9084× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,131,979 → 6,395,938 → 3,197,969 → 9,593,908 → 4,796,954 → 2,398,477 → 7,195,432 → 3,597,716 → 1,798,858 → 899,429 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage213,197,900%
2,131,979% as a decimal21,319.79
2,131,979% of 1002,131,979
2,131,979% of 1,00021,319,790
As a fraction of 1002,131,979/100

Read another way

As bytes2.033 MiB
As a 24-bit colour#20880B

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “2131979” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.