Recognised as Number
4,376,262
- Positive
- Even
- Composite
- 7 digits
4,376,262 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,376,262
Digit count7
Digit sum30
Digit product12,096
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 11 × 61 × 1,087
Distinct prime factors52, 3, 11, 61, 1,087
Number of divisors32
Sum of divisors σ(n)9,713,664
Aliquot sum5,337,402sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,303,200integers below n that share no factor with it
Carmichael function λ(n)10,860the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,303,200
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 11, 22, 33, 61, 66, 122, 183, 366, 671, 1,087, 1,342, 2,013, 2,174, 3,261, 4,026, 6,522, 11,957, 23,914, 35,871, 66,307, 71,742, 132,614, 198,921, 397,842, 729,377, 1,458,754, 2,188,131, 4,376,26232 in total
Arithmetic
Previous number4,376,261
Next number4,376,263
Double8,752,524
Half2,188,131
Square19,151,669,092,644
Cube83,812,721,686,712,416,728
Square root2,091.951720284≈irrational, shown to 9 decimal places
Cube root163.569040038≈
Negation-4,376,262
Reciprocal2.28505515 × 10^-7≈
Representations
Decimal4,376,262
Binary1000010110001101100011023 bits
Octal20543306
Hexadecimal42C6C6
Base 362LSQU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, three hundred and seventy-six thousand, two hundred and sixty-two
Ordinalfour million, three hundred and seventy-six thousand, two hundred and sixty-second
Scientific notation4.376262 × 10^6
Engineering notation4.376262 × 10^6
In other bases
Ternary22020100002210base 3; the most digit-efficient integer base after e: 14 digits
Quinary2110020022base 5; one hand: 10 digits
Septenary52124532base 7: 8 digits
Nonary8210083base 9; each digit is two ternary digits: 7 digits
Duodecimal1570686base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1770d2base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:15:37:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1T0100010T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001111101101111011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000101100011011000110
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes342 c6 c6
Gray code11000111010010110100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000101100011011000110
64-bit0000000000000000000000000000000000000000010000101100011011000110
One's complement11111111101111010011100100111001at 32 bits, every bit flipped
Bits reversed01100011011000110100001000000000at 32 bits
Rotated left by 100000000100001011000110110001100at 32 bits, wrapping
Shifted left by 1100001011000110110001100= 8,752,524, no wrap
Shifted right by 11000010110001101100011= 2,188,131, discarding the low bit
These bits as a double2.16216071 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,376,262 to the power 219,151,669,092,644
4,376,262 to the power 383,812,721,686,712,416,728
4,376,262 to the power 4366,786,429,034,135,454,254,910,736
4,376,262 to the power 51,605,153,511,497,783,691,308,504,167,348,832
First ten multiples4,376,262, 8,752,524, 13,128,786, 17,505,048, 21,881,310, 26,257,572, 30,633,834, 35,010,096, 39,386,358, 43,762,620
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 6
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 1180the total stopping time
Highest value reached9,846,5922× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,376,262 → 2,188,131 → 6,564,394 → 3,282,197 → 9,846,592 → 4,923,296 → 2,461,648 → 1,230,824 → 615,412 → 307,706 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage437,626,200%
4,376,262% as a decimal43,762.62
4,376,262% of 1004,376,262
4,376,262% of 1,00043,762,620
As a fraction of 1004,376,262/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 4,376,262
Nerdulate something else
Nothing in mind? Surprise me · today’s page