Recognised as Number
2,698,273
- Positive
- Odd
- Prime
- 7 digits
2,698,273 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,698,273
Digit count7
Digit sum37
Digit product36,288
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,698,273
Distinct prime factors12,698,273
Number of divisors2
Sum of divisors σ(n)2,698,274
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,698,272integers below n that share no factor with it
Carmichael function λ(n)2,698,272the 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,698,2732 in total
Arithmetic
Previous number2,698,272
Next number2,698,274
Double5,396,546
Half1,349,136.5
Square7,280,677,182,529
Cube19,645,254,663,334,072,417
Square root1,642.642079091≈irrational, shown to 9 decimal places
Cube root139.217969699≈
Negation-2,698,273
Reciprocal3.70607422 × 10^-7≈
Representations
Decimal2,698,273
Binary101001001011000010000122 bits
Octal12226041
Hexadecimal292C21
Base 361LU01
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and ninety-eight thousand, two hundred and seventy-three
Ordinaltwo million, six hundred and ninety-eight thousand, two hundred and seventy-third
Scientific notation2.698273 × 10^6
Engineering notation2.698273 × 10^6
In other bases
Ternary12002002100001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1142321043base 5; one hand: 10 digits
Septenary31635454base 7: 8 digits
Nonary5062301base 9; each digit is two ternary digits: 7 digits
Duodecimalaa1601base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgh5ddbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:29:31:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT01T01T100001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110010111110001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010010010110000100001
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
Bytes329 2c 21
Gray code1111011011101000110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010010010110000100001
64-bit0000000000000000000000000000000000000000001010010010110000100001
One's complement11111111110101101101001111011110at 32 bits, every bit flipped
Bits reversed10000100001101001001010000000000at 32 bits
Rotated left by 100000000010100100101100001000010at 32 bits, wrapping
Shifted left by 110100100101100001000010= 5,396,546, no wrap
Shifted right by 1101001001011000010000= 1,349,136, discarding the low bit
These bits as a double1.33312399 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,698,273 to the power 27,280,677,182,529
2,698,273 to the power 319,645,254,663,334,072,417
2,698,273 to the power 453,008,260,236,198,417,582,835,841
2,698,273 to the power 5143,030,757,372,307,812,806,491,213,202,593
First ten multiples2,698,273, 5,396,546, 8,094,819, 10,793,092, 13,491,365, 16,189,638, 18,887,911, 21,586,184, 24,284,457, 26,982,730
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Highest value reached11,682,9524× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,698,273 → 8,094,820 → 4,047,410 → 2,023,705 → 6,071,116 → 3,035,558 → 1,517,779 → 4,553,338 → 2,276,669 → 6,830,008 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage269,827,300%
2,698,273% as a decimal26,982.73
2,698,273% of 1002,698,273
2,698,273% of 1,00026,982,730
As a fraction of 1002,698,273/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,698,273
Nerdulate something else
Nothing in mind? Surprise me · today’s page