Nerdulator> put something in

Recognised as Number

2,196,041

  • Positive
  • Odd
  • Prime
  • 7 digits

2,196,041 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,196,041
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,196,041
Distinct prime factors12,196,041
Number of divisors2
Sum of divisors σ(n)2,196,042
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,196,040integers below n that share no factor with it
Carmichael function λ(n)2,196,040the 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,196,0412 in total

Arithmetic

Previous number2,196,040
Next number2,196,042
Double4,392,082
Cube10,590,618,704,242,496,921
Square root1,481.904517842≈irrational, shown to 9 decimal places
Cube root129.98108206≈
Negation-2,196,041
Reciprocal4.55364904 × 10^-7≈

Representations

Decimal2,196,041
Binary100001100000100100100122 bits
Octal10301111
Hexadecimal218249
Base 361B2H5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and ninety-six thousand and forty-one
Ordinaltwo million, one hundred and ninety-six thousand and forty-first
Scientific notation2.196041 × 10^6
Engineering notation2.196041 × 10^6

In other bases

Ternary11010120101212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1030233131base 5; one hand: 10 digits
Septenary24444311base 7: 8 digits
Nonary4116355base 9; each digit is two ternary digits: 7 digits
Duodecimal89aa35base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldea21base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:10:0:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11011TT011T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101000011001011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001000011000001001001001
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 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 82 49
Gray code1100010100001101101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001000011000001001001001
64-bit0000000000000000000000000000000000000000001000011000001001001001
One's complement11111111110111100111110110110110at 32 bits, every bit flipped
Bits reversed10010010010000011000010000000000at 32 bits
Rotated left by 100000000010000110000010010010010at 32 bits, wrapping
Shifted left by 110000110000010010010010= 4,392,082, no wrap
Shifted right by 1100001100000100100100= 1,098,020, discarding the low bit
These bits as a double1.08498841 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,196,049+8
Previous prime2,196,037−4
Distance to nearest prime0, it is prime
Nearest square below2,193,361
Nearest square above2,196,324

Powers & multiples

2,196,041 to the power 24,822,596,073,681
2,196,041 to the power 310,590,618,704,242,496,921
2,196,041 to the power 423,257,432,889,883,397,180,889,761
2,196,041 to the power 551,074,276,180,932,425,428,518,331,636,201
First ten multiples2,196,041, 4,392,082, 6,588,123, 8,784,164, 10,980,205, 13,176,246, 15,372,287, 17,568,328, 19,764,369, 21,960,410
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1223the total stopping time
Highest value reached11,117,4645× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,196,041 → 6,588,124 → 3,294,062 → 1,647,031 → 4,941,094 → 2,470,547 → 7,411,642 → 3,705,821 → 11,117,464 → 5,558,732 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage219,604,100%
2,196,041% as a decimal21,960.41
2,196,041% of 1002,196,041
2,196,041% of 1,00021,960,410
As a fraction of 1002,196,041/100

Read another way

As bytes2.094 MiB
As a 24-bit colour#218249

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 “2196041” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.