Recognised as Number
2,201,627
- Positive
- Odd
- Prime
- 7 digits
2,201,627 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,201,627
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,201,627
Distinct prime factors12,201,627
Number of divisors2
Sum of divisors σ(n)2,201,628
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,201,626integers below n that share no factor with it
Carmichael function λ(n)2,201,626the 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,201,6272 in total
Arithmetic
Previous number2,201,626
Next number2,201,628
Double4,403,254
Half1,100,813.5
Square4,847,161,447,129
Cube10,671,641,515,358,278,883
Square root1,483.788057642≈irrational, shown to 9 decimal places
Cube root130.091198334≈
Negation-2,201,627
Reciprocal4.54209546 × 10^-7≈
Representations
Decimal2,201,627
Binary100001100110000001101122 bits
Octal10314033
Hexadecimal21981B
Base 361B6SB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and one thousand, six hundred and twenty-seven
Ordinaltwo million, two hundred and one thousand, six hundred and twenty-seventh
Scientific notation2.201627 × 10^6
Engineering notation2.201627 × 10^6
In other bases
Ternary11010212001202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1030423002base 5; one hand: 10 digits
Septenary24466511base 7: 8 digits
Nonary4125052base 9; each digit is two ternary digits: 7 digits
Duodecimal8a210bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldf417base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:11:33:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110110TT01TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101110100001101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000011001100000011011
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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 98 1b
Gray code1100010101010000010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000011001100000011011
64-bit0000000000000000000000000000000000000000001000011001100000011011
One's complement11111111110111100110011111100100at 32 bits, every bit flipped
Bits reversed11011000000110011000010000000000at 32 bits
Rotated left by 100000000010000110011000000110110at 32 bits, wrapping
Shifted left by 110000110011000000110110= 4,403,254, no wrap
Shifted right by 1100001100110000001101= 1,100,813, discarding the low bit
These bits as a double1.08774827 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,201,627 to the power 24,847,161,447,129
2,201,627 to the power 310,671,641,515,358,278,883
2,201,627 to the power 423,494,974,094,533,701,462,342,641
2,201,627 to the power 551,727,169,330,825,949,549,433,041,676,907
First ten multiples2,201,627, 4,403,254, 6,604,881, 8,806,508, 11,008,135, 13,209,762, 15,411,389, 17,613,016, 19,814,643, 22,016,270
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 27
Collatz (3n + 1) trajectory
Steps to reach 1241the total stopping time
Highest value reached37,616,88417× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,201,627 → 6,604,882 → 3,302,441 → 9,907,324 → 4,953,662 → 2,476,831 → 7,430,494 → 3,715,247 → 11,145,742 → 5,572,871 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage220,162,700%
2,201,627% as a decimal22,016.27
2,201,627% of 1002,201,627
2,201,627% of 1,00022,016,270
As a fraction of 1002,201,627/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,627
Nerdulate something else
Nothing in mind? Surprise me · today’s page