Recognised as Number

3,958,426

Positive
Even
Composite
7 digits

3,958,426 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,958,426

Digit count7

Digit sum37

Digit product51,840

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 227 × 8,719

Distinct prime factors32, 227, 8,719

Number of divisors8

Sum of divisors σ(n)5,964,480

Aliquot sum2,006,054sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,970,268integers below n that share no factor with it

Carmichael function λ(n)985,134the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,970,268

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 227, 454, 8,719, 17,438, 1,979,213, 3,958,4268 in total

Arithmetic

Previous number3,958,425

Next number3,958,427

Double7,916,852

Half1,979,213

Square15,669,136,397,476

Cube62,025,116,913,315,332,776

Square root1,989.579352527≈irrational, shown to 9 decimal places

Cube root158.188233704≈

Negation-3,958,426

Reciprocal2.52625665 × 10^-7≈

Representations

Decimal3,958,426

Binary111100011001101001101022 bits

Octal17063232

Hexadecimal3C669A

Base 362CUCA

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthree million, nine hundred and fifty-eight thousand, four hundred and twenty-six

Ordinalthree million, nine hundred and fifty-eight thousand, four hundred and twenty-sixth

Scientific notation3.958426 × 10^6

Engineering notation3.958426 × 10^6

In other bases

Ternary21110002221101base 3; the most digit-efficient integer base after e: 14 digits

Quinary2003132201base 5; one hand: 10 digits

Septenary45434413base 7: 8 digits

Nonary7402841base 9; each digit is two ternary digits: 7 digits

Duodecimal13aa90abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal14eg16base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal18:19:33:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T11100100T1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10011011011101111101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001111000110011010011010

Bit length22 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits10within that length

Bit parityeven12 set bits, so even; 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

Bytes33c 66 9a

Gray code1000100101010111010111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001111000110011010011010

64-bit0000000000000000000000000000000000000000001111000110011010011010

One's complement11111111110000111001100101100101at 32 bits, every bit flipped

Bits reversed01011001011001100011110000000000at 32 bits

Rotated left by 100000000011110001100110100110100at 32 bits, wrapping

Shifted left by 111110001100110100110100= 7,916,852, no wrap

Shifted right by 1111100011001101001101= 1,979,213, discarding the low bit

These bits as a double1.9557223 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,958,439+13

Previous prime3,958,397−29

Distance to nearest prime13

Nearest square below3,956,121

Nearest square above3,960,100

Powers & multiples

3,958,426 to the power 215,669,136,397,476

3,958,426 to the power 362,025,116,913,315,332,776

3,958,426 to the power 4245,521,835,442,707,159,459,170,576

3,958,426 to the power 5971,880,016,984,133,530,389,326,746,473,376

First ten multiples3,958,426, 7,916,852, 11,875,278, 15,833,704, 19,792,130, 23,750,556, 27,708,982, 31,667,408, 35,625,834, 39,584,260

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 1

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 1

Divisible by 10No, remainder 6

Divisible by 11No, remainder 10

Divisible by 12No, remainder 10

Divisible by 100No, remainder 26

Collatz (3n + 1) trajectory

Steps to reach 1123the total stopping time

Highest value reached5,937,6401× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps3,958,426 → 1,979,213 → 5,937,640 → 2,968,820 → 1,484,410 → 742,205 → 2,226,616 → 1,113,308 → 556,654 → 278,327 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage395,842,600%

3,958,426% as a decimal39,584.26

3,958,426% of 1003,958,426

3,958,426% of 1,00039,584,260

As a fraction of 1003,958,426/100

Read another way

As seconds45 days, 19 hours and 33 minutes

As bytes3.775 MiB

As a 24-bit colour#3C669A

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.