Recognised as Number
2,632,138
- Positive
- Even
- Composite
- 7 digits
2,632,138 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,632,138
Digit count7
Digit sum25
Digit product1,728
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 1,021 × 1,289
Distinct prime factors32, 1,021, 1,289
Number of divisors8
Sum of divisors σ(n)3,955,140
Aliquot sum1,323,002sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,313,760integers below n that share no factor with it
Carmichael function λ(n)328,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,313,760
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,021, 1,289, 2,042, 2,578, 1,316,069, 2,632,1388 in total
Arithmetic
Previous number2,632,137
Next number2,632,139
Double5,264,276
Half1,316,069
Square6,928,150,451,044
Cube18,235,848,071,910,052,072
Square root1,622.386513751≈irrational, shown to 9 decimal places
Cube root138.071131851≈
Negation-2,632,138
Reciprocal3.7991929 × 10^-7≈
Representations
Decimal2,632,138
Binary101000001010011100101022 bits
Octal12024712
Hexadecimal2829CA
Base 361KEYY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, six hundred and thirty-two thousand, one hundred and thirty-eight
Ordinaltwo million, six hundred and thirty-two thousand, one hundred and thirty-eighth
Scientific notation2.632138 × 10^6
Engineering notation2.632138 × 10^6
In other bases
Ternary11221201121121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1133212023base 5; one hand: 10 digits
Septenary31241605base 7: 8 digits
Nonary4851547base 9; each digit is two ternary digits: 7 digits
Duodecimala6b28abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalg906ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:11:8:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT00TT1TT0TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110000111111011011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010000010100111001010
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 11 trailing zero
Power of twoNo
Bytes328 29 ca
Gray code1111000011110100101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010000010100111001010
64-bit0000000000000000000000000000000000000000001010000010100111001010
One's complement11111111110101111101011000110101at 32 bits, every bit flipped
Bits reversed01010011100101000001010000000000at 32 bits
Rotated left by 100000000010100000101001110010100at 32 bits, wrapping
Shifted left by 110100000101001110010100= 5,264,276, no wrap
Shifted right by 1101000001010011100101= 1,316,069, discarding the low bit
These bits as a double1.30044896 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,632,138 to the power 26,928,150,451,044
2,632,138 to the power 318,235,848,071,910,052,072
2,632,138 to the power 447,999,268,672,301,180,640,689,936
2,632,138 to the power 5126,340,699,044,573,485,009,224,326,763,168
First ten multiples2,632,138, 5,264,276, 7,896,414, 10,528,552, 13,160,690, 15,792,828, 18,424,966, 21,057,104, 23,689,242, 26,321,380
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 181the total stopping time
Highest value reached3,948,2081× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,632,138 → 1,316,069 → 3,948,208 → 1,974,104 → 987,052 → 493,526 → 246,763 → 740,290 → 370,145 → 1,110,436 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage263,213,800%
2,632,138% as a decimal26,321.38
2,632,138% of 1002,632,138
2,632,138% of 1,00026,321,380
As a fraction of 1002,632,138/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,632,138
Nerdulate something else
Nothing in mind? Surprise me · today’s page