Recognised as Number
3,925,024
- Positive
- Even
- Composite
- 7 digits
3,925,024 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,925,024
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^5 × 173 × 709
Distinct prime factors32, 173, 709
Number of divisors24
Sum of divisors σ(n)7,783,020
Aliquot sum3,857,996sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,948,416integers below n that share no factor with it
Carmichael function λ(n)60,888the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,948,416
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 173, 346, 692, 709, 1,384, 1,418, 2,768, 2,836, 5,536, 5,672, 11,344, 22,688, 122,657, 245,314, 490,628, 981,256, 1,962,512, 3,925,02424 in total
Arithmetic
Previous number3,925,023
Next number3,925,025
Double7,850,048
Half1,962,512
Square15,405,813,400,576
Cube60,468,187,336,782,413,824
Square root1,981.16733266≈irrational, shown to 9 decimal places
Cube root157.742034855≈
Negation-3,925,024
Reciprocal2.54775512 × 10^-7≈
Representations
Decimal3,925,024
Binary111011111001000010000022 bits
Octal16762040
Hexadecimal3BE420
Base 362C4KG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and twenty-five thousand and twenty-four
Ordinalthree million, nine hundred and twenty-five thousand and twenty-fourth
Scientific notation3.925024 × 10^6
Engineering notation3.925024 × 10^6
In other bases
Ternary21101102010021base 3; the most digit-efficient integer base after e: 14 digits
Quinary2001100044base 5; one hand: 10 digits
Septenary45235135base 7: 8 digits
Nonary7342107base 9; each digit is two ternary digits: 7 digits
Duodecimal1393514base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14acb4base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:10:17:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T110111T0101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011000010010001100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110111110010000100000
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes33b e4 20
Gray code1001100001011000110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110111110010000100000
64-bit0000000000000000000000000000000000000000001110111110010000100000
One's complement11111111110001000001101111011111at 32 bits, every bit flipped
Bits reversed00000100001001111101110000000000at 32 bits
Rotated left by 100000000011101111100100001000000at 32 bits, wrapping
Shifted left by 111101111100100001000000= 7,850,048, no wrap
Shifted right by 1111011111001000010000= 1,962,512, discarding the low bit
These bits as a double1.93921952 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,925,024 to the power 215,405,813,400,576
3,925,024 to the power 360,468,187,336,782,413,824
3,925,024 to the power 4237,339,086,533,367,057,037,131,776
3,925,024 to the power 5931,561,610,781,542,499,680,111,111,962,624
First ten multiples3,925,024, 7,850,048, 11,775,072, 15,700,096, 19,625,120, 23,550,144, 27,475,168, 31,400,192, 35,325,216, 39,250,240
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 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 4
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 24
Collatz (3n + 1) trajectory
Steps to reach 1185the total stopping time
Highest value reached3,925,024
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,925,024 → 1,962,512 → 981,256 → 490,628 → 245,314 → 122,657 → 367,972 → 183,986 → 91,993 → 275,980 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage392,502,400%
3,925,024% as a decimal39,250.24
3,925,024% of 1003,925,024
3,925,024% of 1,00039,250,240
As a fraction of 1003,925,024/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 3,925,024
Nerdulate something else
Nothing in mind? Surprise me · today’s page