Recognised as Number
2,214,137
- Positive
- Odd
- Prime
- 7 digits
2,214,137 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,214,137
Digit count7
Digit sum20
Digit product336
Multiplicative persistence4times 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,214,137
Distinct prime factors12,214,137
Number of divisors2
Sum of divisors σ(n)2,214,138
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,214,136integers below n that share no factor with it
Carmichael function λ(n)2,214,136the 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,214,1372 in total
Arithmetic
Previous number2,214,136
Next number2,214,138
Double4,428,274
Half1,107,068.5
Square4,902,402,654,769
Cube10,854,591,106,822,269,353
Square root1,487.997647848≈irrational, shown to 9 decimal places
Cube root130.337132837≈
Negation-2,214,137
Reciprocal4.51643236 × 10^-7≈
Representations
Decimal2,214,137
Binary100001110010001111100122 bits
Octal10344371
Hexadecimal21C8F9
Base 361BGFT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and fourteen thousand, one hundred and thirty-seven
Ordinaltwo million, two hundred and fourteen thousand, one hundred and thirty-seventh
Scientific notation2.214137 × 10^6
Engineering notation2.214137 × 10^6
In other bases
Ternary11011111020002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1031323022base 5; one hand: 10 digits
Septenary24551132base 7: 8 digits
Nonary4144202base 9; each digit is two ternary digits: 7 digits
Duodecimal8a93b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldgf6hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:15:2:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110111111T001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101101100100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000011100100011111001
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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 c8 f9
Gray code1100010010110010000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000011100100011111001
64-bit0000000000000000000000000000000000000000001000011100100011111001
One's complement11111111110111100011011100000110at 32 bits, every bit flipped
Bits reversed10011111000100111000010000000000at 32 bits
Rotated left by 100000000010000111001000111110010at 32 bits, wrapping
Shifted left by 110000111001000111110010= 4,428,274, no wrap
Shifted right by 1100001110010001111100= 1,107,068, discarding the low bit
These bits as a double1.09392903 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,214,137 to the power 24,902,402,654,769
2,214,137 to the power 310,854,591,106,822,269,353
2,214,137 to the power 424,033,551,789,486,138,998,443,361
2,214,137 to the power 553,213,576,258,517,471,343,596,387,994,457
First ten multiples2,214,137, 4,428,274, 6,642,411, 8,856,548, 11,070,685, 13,284,822, 15,498,959, 17,713,096, 19,927,233, 22,141,370
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 160the total stopping time
Highest value reached8,406,8083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,214,137 → 6,642,412 → 3,321,206 → 1,660,603 → 4,981,810 → 2,490,905 → 7,472,716 → 3,736,358 → 1,868,179 → 5,604,538 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage221,413,700%
2,214,137% as a decimal22,141.37
2,214,137% of 1002,214,137
2,214,137% of 1,00022,141,370
As a fraction of 1002,214,137/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,214,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page