Recognised as Number
2,664,755
- Positive
- Odd
- Composite
- 7 digits
2,664,755 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,664,755
Digit count7
Digit sum35
Digit product50,400
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 532,951
Distinct prime factors25, 532,951
Number of divisors4
Sum of divisors σ(n)3,197,712
Aliquot sum532,957sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,131,800integers below n that share no factor with it
Carmichael function λ(n)1,065,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,131,800
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 532,951, 2,664,7554 in total
Arithmetic
Previous number2,664,754
Next number2,664,756
Double5,329,510
Half1,332,377.5
Square7,100,919,210,025
Cube18,922,209,969,510,168,875
Square root1,632.40773093≈irrational, shown to 9 decimal places
Cube root138.639110058≈
Negation-2,664,755
Reciprocal3.75269021 × 10^-7≈
Representations
Decimal2,664,755
Binary101000101010010011001122 bits
Octal12124463
Hexadecimal28A933
Base 361L44Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and sixty-four thousand, seven hundred and fifty-five
Ordinaltwo million, six hundred and sixty-four thousand, seven hundred and fifty-fifth
Scientific notation2.664755 × 10^6
Engineering notation2.664755 × 10^6
In other bases
Ternary12000101100122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1140233010base 5; one hand: 10 digits
Septenary31435652base 7: 8 digits
Nonary5011318base 9; each digit is two ternary digits: 7 digits
Duodecimala8612bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalgd1hfbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:20:12:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT000101101T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110011111100101110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010001010100100110011
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes328 a9 33
Gray code1111001111110110101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010001010100100110011
64-bit0000000000000000000000000000000000000000001010001010100100110011
One's complement11111111110101110101011011001100at 32 bits, every bit flipped
Bits reversed11001100100101010001010000000000at 32 bits
Rotated left by 100000000010100010101001001100110at 32 bits, wrapping
Shifted left by 110100010101001001100110= 5,329,510, no wrap
Shifted right by 1101000101010010011001= 1,332,377, discarding the low bit
These bits as a double1.3165639 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,664,755 to the power 27,100,919,210,025
2,664,755 to the power 318,922,209,969,510,168,875
2,664,755 to the power 450,423,053,627,302,070,060,500,625
2,664,755 to the power 5134,365,084,268,621,327,704,069,342,971,875
First ten multiples2,664,755, 5,329,510, 7,994,265, 10,659,020, 13,323,775, 15,988,530, 18,653,285, 21,318,040, 23,982,795, 26,647,550
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 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1187the total stopping time
Highest value reached11,991,4004× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,664,755 → 7,994,266 → 3,997,133 → 11,991,400 → 5,995,700 → 2,997,850 → 1,498,925 → 4,496,776 → 2,248,388 → 1,124,194 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage266,475,500%
2,664,755% as a decimal26,647.55
2,664,755% of 1002,664,755
2,664,755% of 1,00026,647,550
As a fraction of 1002,664,755/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,664,755
Nerdulate something else
Nothing in mind? Surprise me · today’s page