Recognised as Number
4,201,958
- Positive
- Even
- Composite
- 7 digits
4,201,958 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,201,958
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 17 × 83 × 1,489
Distinct prime factors42, 17, 83, 1,489
Number of divisors16
Sum of divisors σ(n)6,758,640
Aliquot sum2,556,682sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,952,256integers below n that share no factor with it
Carmichael function λ(n)61,008the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,952,256
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 17, 34, 83, 166, 1,411, 1,489, 2,822, 2,978, 25,313, 50,626, 123,587, 247,174, 2,100,979, 4,201,95816 in total
Arithmetic
Previous number4,201,957
Next number4,201,959
Double8,403,916
Half2,100,979
Square17,656,451,033,764
Cube74,191,665,672,932,909,912
Square root2,049.867800615≈irrational, shown to 9 decimal places
Cube root161.367932876≈
Negation-4,201,958
Reciprocal2.37984292 × 10^-7≈
Representations
Decimal4,201,958
Binary1000000000111011110011023 bits
Octal20016746
Hexadecimal401DE6
Base 362I292
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and one thousand, nine hundred and fifty-eight
Ordinalfour million, two hundred and one thousand, nine hundred and fifty-eighth
Scientific notation4.201958 × 10^6
Engineering notation4.201958 × 10^6
In other bases
Ternary21220111000002base 3; the most digit-efficient integer base after e: 14 digits
Quinary2033430313base 5; one hand: 10 digits
Septenary50500415base 7: 8 digits
Nonary7814002base 9; each digit is two ternary digits: 7 digits
Duodecimal14a7832base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1654hibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:27:12:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T011100001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000000110001000111010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000000001110111100110
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
Bytes340 1d e6
Gray code11000000001001100010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000000001110111100110
64-bit0000000000000000000000000000000000000000010000000001110111100110
One's complement11111111101111111110001000011001at 32 bits, every bit flipped
Bits reversed01100111101110000000001000000000at 32 bits
Rotated left by 100000000100000000011101111001100at 32 bits, wrapping
Shifted left by 1100000000011101111001100= 8,403,916, no wrap
Shifted right by 11000000000111011110011= 2,100,979, discarding the low bit
These bits as a double2.07604309 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,201,958 to the power 217,656,451,033,764
4,201,958 to the power 374,191,665,672,932,909,912
4,201,958 to the power 4311,750,263,107,705,824,268,007,696
4,201,958 to the power 51,309,961,512,067,529,349,929,549,082,268,768
First ten multiples4,201,958, 8,403,916, 12,605,874, 16,807,832, 21,009,790, 25,211,748, 29,413,706, 33,615,664, 37,817,622, 42,019,580
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 2
Divisible by 12No, remainder 2
Divisible by 100No, remainder 58
Collatz (3n + 1) trajectory
Steps to reach 1229the total stopping time
Highest value reached9,583,4322× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,201,958 → 2,100,979 → 6,302,938 → 3,151,469 → 9,454,408 → 4,727,204 → 2,363,602 → 1,181,801 → 3,545,404 → 1,772,702 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage420,195,800%
4,201,958% as a decimal42,019.58
4,201,958% of 1004,201,958
4,201,958% of 1,00042,019,580
As a fraction of 1004,201,958/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,201,958
Nerdulate something else
Nothing in mind? Surprise me · today’s page