Recognised as Number
2,642,552
- Positive
- Even
- Composite
- 7 digits
2,642,552 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,642,552
Digit count7
Digit sum26
Digit product4,800
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 factorisation2^3 × 11 × 30,029
Distinct prime factors32, 11, 30,029
Number of divisors16
Sum of divisors σ(n)5,405,400
Aliquot sum2,762,848sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,201,120integers below n that share no factor with it
Carmichael function λ(n)150,140the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,201,120
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 11, 22, 44, 88, 30,029, 60,058, 120,116, 240,232, 330,319, 660,638, 1,321,276, 2,642,55216 in total
Arithmetic
Previous number2,642,551
Next number2,642,553
Double5,285,104
Half1,321,276
Square6,983,081,072,704
Cube18,453,154,854,836,100,608
Square root1,625.592814945≈irrational, shown to 9 decimal places
Cube root138.252984097≈
Negation-2,642,552
Reciprocal3.78422071 × 10^-7≈
Representations
Decimal2,642,552
Binary101000010100100111100022 bits
Octal12051170
Hexadecimal285278
Base 361KN08
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and forty-two thousand, five hundred and fifty-two
Ordinaltwo million, six hundred and forty-two thousand, five hundred and fifty-second
Scientific notation2.642552 × 10^6
Engineering notation2.642552 × 10^6
In other bases
Ternary11222020220022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1134030202base 5; one hand: 10 digits
Septenary31314143base 7: 8 digits
Nonary4866808base 9; each digit is two ternary digits: 7 digits
Duodecimala75308base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalga67cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:14:2:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00T1T10T010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110000101011110001000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010000101001001111000
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes328 52 78
Gray code1111000111101101000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010000101001001111000
64-bit0000000000000000000000000000000000000000001010000101001001111000
One's complement11111111110101111010110110000111at 32 bits, every bit flipped
Bits reversed00011110010010100001010000000000at 32 bits
Rotated left by 100000000010100001010010011110000at 32 bits, wrapping
Shifted left by 110100001010010011110000= 5,285,104, no wrap
Shifted right by 1101000010100100111100= 1,321,276, discarding the low bit
These bits as a double1.30559416 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,642,552 to the power 26,983,081,072,704
2,642,552 to the power 318,453,154,854,836,100,608
2,642,552 to the power 448,763,421,267,956,847,333,871,616
2,642,552 to the power 5128,859,876,398,481,902,835,817,106,604,032
First ten multiples2,642,552, 5,285,104, 7,927,656, 10,570,208, 13,212,760, 15,855,312, 18,497,864, 21,140,416, 23,782,968, 26,425,520
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 8
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 1156the total stopping time
Highest value reached3,344,4881× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,642,552 → 1,321,276 → 660,638 → 330,319 → 990,958 → 495,479 → 1,486,438 → 743,219 → 2,229,658 → 1,114,829 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage264,255,200%
2,642,552% as a decimal26,425.52
2,642,552% of 1002,642,552
2,642,552% of 1,00026,425,520
As a fraction of 1002,642,552/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,642,552
Nerdulate something else
Nothing in mind? Surprise me · today’s page