Recognised as Number
4,212,671
- Positive
- Odd
- Composite
- 7 digits
4,212,671 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,212,671
Digit count7
Digit sum23
Digit product672
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,487 × 2,833
Distinct prime factors21,487, 2,833
Number of divisors4
Sum of divisors σ(n)4,216,992
Aliquot sum4,321sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,208,352integers below n that share no factor with it
Carmichael function λ(n)2,104,176the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,208,352
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,487, 2,833, 4,212,6714 in total
Arithmetic
Previous number4,212,670
Next number4,212,672
Double8,425,342
Half2,106,335.5
Square17,746,596,954,241
Cube74,760,574,337,819,387,711
Square root2,052.479232538≈irrational, shown to 9 decimal places
Cube root161.504953728≈
Negation-4,212,671
Reciprocal2.37379088 × 10^-7≈
Representations
Decimal4,212,671
Binary1000000010001111011111123 bits
Octal20043677
Hexadecimal4047BF
Base 362IAIN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and twelve thousand, six hundred and seventy-one
Ordinalfour million, two hundred and twelve thousand, six hundred and seventy-first
Scientific notation4.212671 × 10^6
Engineering notation4.212671 × 10^6
In other bases
Ternary21221000200212base 3; the most digit-efficient integer base after e: 14 digits
Quinary2034301141base 5; one hand: 10 digits
Septenary50543561base 7: 8 digits
Nonary7830625base 9; each digit is two ternary digits: 7 digits
Duodecimal14b1a7bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal166bdbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:30:11:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T1001T010TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000000101100011000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000000100011110111111
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes340 47 bf
Gray code11000000110010001100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000000100011110111111
64-bit0000000000000000000000000000000000000000010000000100011110111111
One's complement11111111101111111011100001000000at 32 bits, every bit flipped
Bits reversed11111101111000100000001000000000at 32 bits
Rotated left by 100000000100000001000111101111110at 32 bits, wrapping
Shifted left by 1100000001000111101111110= 8,425,342, no wrap
Shifted right by 11000000010001111011111= 2,106,335, discarding the low bit
These bits as a double2.08133602 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,212,671 to the power 217,746,596,954,241
4,212,671 to the power 374,760,574,337,819,387,711
4,212,671 to the power 4314,941,703,456,275,937,847,886,081
4,212,671 to the power 51,326,745,780,840,853,411,369,592,104,732,351
First ten multiples4,212,671, 8,425,342, 12,638,013, 16,850,684, 21,063,355, 25,276,026, 29,488,697, 33,701,368, 37,914,039, 42,126,710
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1198the total stopping time
Highest value reached107,966,17625× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,212,671 → 12,638,014 → 6,319,007 → 18,957,022 → 9,478,511 → 28,435,534 → 14,217,767 → 42,653,302 → 21,326,651 → 63,979,954 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage421,267,100%
4,212,671% as a decimal42,126.71
4,212,671% of 1004,212,671
4,212,671% of 1,00042,126,710
As a fraction of 1004,212,671/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,212,671
Nerdulate something else
Nothing in mind? Surprise me · today’s page