Recognised as Number
2,201,641
- Positive
- Odd
- Composite
- 7 digits
2,201,641 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,201,641
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 163 × 1,039
Distinct prime factors313, 163, 1,039
Number of divisors8
Sum of divisors σ(n)2,387,840
Aliquot sum186,199sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,017,872integers below n that share no factor with it
Carmichael function λ(n)56,052the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,017,872
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 163, 1,039, 2,119, 13,507, 169,357, 2,201,6418 in total
Arithmetic
Previous number2,201,640
Next number2,201,642
Double4,403,282
Half1,100,820.5
Square4,847,223,092,881
Cube10,671,845,097,433,617,721
Square root1,483.792775289≈irrational, shown to 9 decimal places
Cube root130.091474081≈
Negation-2,201,641
Reciprocal4.54206658 × 10^-7≈
Representations
Decimal2,201,641
Binary100001100110000010100122 bits
Octal10314051
Hexadecimal219829
Base 361B6SP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and one thousand, six hundred and forty-one
Ordinaltwo million, two hundred and one thousand, six hundred and forty-first
Scientific notation2.201641 × 10^6
Engineering notation2.201641 × 10^6
In other bases
Ternary11010212002021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1030423031base 5; one hand: 10 digits
Septenary24466531base 7: 8 digits
Nonary4125067base 9; each digit is two ternary digits: 7 digits
Duodecimal8a2121base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldf421base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:11:34:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110110TT01T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101110100001111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000011001100000101001
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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 98 29
Gray code1100010101010000111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000011001100000101001
64-bit0000000000000000000000000000000000000000001000011001100000101001
One's complement11111111110111100110011111010110at 32 bits, every bit flipped
Bits reversed10010100000110011000010000000000at 32 bits
Rotated left by 100000000010000110011000001010010at 32 bits, wrapping
Shifted left by 110000110011000001010010= 4,403,282, no wrap
Shifted right by 1100001100110000010100= 1,100,820, discarding the low bit
These bits as a double1.08775518 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,201,641 to the power 24,847,223,092,881
2,201,641 to the power 310,671,845,097,433,617,721
2,201,641 to the power 423,495,571,712,158,847,552,880,161
2,201,641 to the power 551,728,813,999,929,117,285,170,630,544,201
First ten multiples2,201,641, 4,403,282, 6,604,923, 8,806,564, 11,008,205, 13,209,846, 15,411,487, 17,613,128, 19,814,769, 22,016,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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1210the total stopping time
Highest value reached25,078,08411× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,201,641 → 6,604,924 → 3,302,462 → 1,651,231 → 4,953,694 → 2,476,847 → 7,430,542 → 3,715,271 → 11,145,814 → 5,572,907 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage220,164,100%
2,201,641% as a decimal22,016.41
2,201,641% of 1002,201,641
2,201,641% of 1,00022,016,410
As a fraction of 1002,201,641/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,201,641
Nerdulate something else
Nothing in mind? Surprise me · today’s page