Recognised as Number
2,676,573
- Positive
- Odd
- Composite
- 7 digits
2,676,573 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,676,573
Digit count7
Digit sum36
Digit product52,920
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 297,397
Distinct prime factors23, 297,397
Number of divisors6
Sum of divisors σ(n)3,866,174
Aliquot sum1,189,601sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,784,376integers below n that share no factor with it
Carmichael function λ(n)297,396the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,784,376
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 297,397, 892,191, 2,676,5736 in total
Arithmetic
Previous number2,676,572
Next number2,676,574
Double5,353,146
Half1,338,286.5
Square7,164,043,024,329
Cube19,175,084,129,757,344,517
Square root1,636.023532838≈irrational, shown to 9 decimal places
Cube root138.84375937≈
Negation-2,676,573
Reciprocal3.73612078 × 10^-7≈
Representations
Decimal2,676,573
Binary101000110101110101110122 bits
Octal12153535
Hexadecimal28D75D
Base 361LD99
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and seventy-six thousand, five hundred and seventy-three
Ordinaltwo million, six hundred and seventy-six thousand, five hundred and seventy-third
Scientific notation2.676573 × 10^6
Engineering notation2.676573 × 10^6
In other bases
Ternary12000222120100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1141122243base 5; one hand: 10 digits
Septenary31515264base 7: 8 digits
Nonary5028510base 9; each digit is two ternary digits: 7 digits
Duodecimala90b39base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgeb8dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:23:29:33base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT001000TT0100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110010010100010101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010001101011101011101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes328 d7 5d
Gray code1111001011110011110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010001101011101011101
64-bit0000000000000000000000000000000000000000001010001101011101011101
One's complement11111111110101110010100010100010at 32 bits, every bit flipped
Bits reversed10111010111010110001010000000000at 32 bits
Rotated left by 100000000010100011010111010111010at 32 bits, wrapping
Shifted left by 110100011010111010111010= 5,353,146, no wrap
Shifted right by 1101000110101110101110= 1,338,286, discarding the low bit
These bits as a double1.32240277 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,676,573 to the power 27,164,043,024,329
2,676,573 to the power 319,175,084,129,757,344,517
2,676,573 to the power 451,323,512,454,437,004,885,900,241
2,676,573 to the power 5137,371,127,700,709,817,478,468,665,754,093
First ten multiples2,676,573, 5,353,146, 8,029,719, 10,706,292, 13,382,865, 16,059,438, 18,736,011, 21,412,584, 24,089,157, 26,765,730
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 194the total stopping time
Highest value reached8,029,7203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,676,573 → 8,029,720 → 4,014,860 → 2,007,430 → 1,003,715 → 3,011,146 → 1,505,573 → 4,516,720 → 2,258,360 → 1,129,180 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage267,657,300%
2,676,573% as a decimal26,765.73
2,676,573% of 1002,676,573
2,676,573% of 1,00026,765,730
As a fraction of 1002,676,573/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,676,573
Nerdulate something else
Nothing in mind? Surprise me · today’s page