Recognised as Number
2,215,091
- Positive
- Odd
- Prime
- 7 digits
2,215,091 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,215,091
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,215,091
Distinct prime factors12,215,091
Number of divisors2
Sum of divisors σ(n)2,215,092
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,215,090integers below n that share no factor with it
Carmichael function λ(n)2,215,090the 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,215,0912 in total
Arithmetic
Previous number2,215,090
Next number2,215,092
Double4,430,182
Half1,107,545.5
Square4,906,628,138,281
Cube10,868,627,829,452,998,571
Square root1,488.318178348≈irrational, shown to 9 decimal places
Cube root130.355849501≈
Negation-2,215,091
Reciprocal4.51448722 × 10^-7≈
Representations
Decimal2,215,091
Binary100001110011001011001122 bits
Octal10346263
Hexadecimal21CCB3
Base 361BH6B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and fifteen thousand and ninety-one
Ordinaltwo million, two hundred and fifteen thousand and ninety-first
Scientific notation2.215091 × 10^6
Engineering notation2.215091 × 10^6
In other bases
Ternary11011112112102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1031340331base 5; one hand: 10 digits
Septenary24553664base 7: 8 digits
Nonary4145472base 9; each digit is two ternary digits: 7 digits
Duodecimal8a9a6bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldghebbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:15:18:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111TTTT0TTT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101101110111110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000011100110010110011
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 cc b3
Gray code1100010010101011101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000011100110010110011
64-bit0000000000000000000000000000000000000000001000011100110010110011
One's complement11111111110111100011001101001100at 32 bits, every bit flipped
Bits reversed11001101001100111000010000000000at 32 bits
Rotated left by 100000000010000111001100101100110at 32 bits, wrapping
Shifted left by 110000111001100101100110= 4,430,182, no wrap
Shifted right by 1100001110011001011001= 1,107,545, discarding the low bit
These bits as a double1.09440037 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,215,091 to the power 24,906,628,138,281
2,215,091 to the power 310,868,627,829,452,998,571
2,215,091 to the power 424,074,999,687,370,872,057,634,961
2,215,091 to the power 553,328,315,132,498,032,357,018,683,396,451
First ten multiples2,215,091, 4,430,182, 6,645,273, 8,860,364, 11,075,455, 13,290,546, 15,505,637, 17,720,728, 19,935,819, 22,150,910
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 160the total stopping time
Highest value reached9,967,9124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,215,091 → 6,645,274 → 3,322,637 → 9,967,912 → 4,983,956 → 2,491,978 → 1,245,989 → 3,737,968 → 1,868,984 → 934,492 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage221,509,100%
2,215,091% as a decimal22,150.91
2,215,091% of 1002,215,091
2,215,091% of 1,00022,150,910
As a fraction of 1002,215,091/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,215,091
Nerdulate something else
Nothing in mind? Surprise me · today’s page