Recognised as Number
4,271,672
- Positive
- Even
- Composite
- 7 digits
4,271,672 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,271,672
Digit count7
Digit sum29
Digit product4,704
Multiplicative persistence2times 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^3 × 533,959
Distinct prime factors22, 533,959
Number of divisors8
Sum of divisors σ(n)8,009,400
Aliquot sum3,737,728sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,135,832integers below n that share no factor with it
Carmichael function λ(n)533,958the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,135,832
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 533,959, 1,067,918, 2,135,836, 4,271,6728 in total
Arithmetic
Previous number4,271,671
Next number4,271,673
Double8,543,344
Half2,135,836
Square18,247,181,675,584
Cube77,945,975,042,505,256,448
Square root2,066.802361137≈irrational, shown to 9 decimal places
Cube root162.255452281≈
Negation-4,271,672
Reciprocal2.34100371 × 10^-7≈
Representations
Decimal4,271,672
Binary1000001001011100011100023 bits
Octal20227070
Hexadecimal412E38
Base 362JK1K
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, two hundred and seventy-one thousand, six hundred and seventy-two
Ordinalfour million, two hundred and seventy-one thousand, six hundred and seventy-second
Scientific notation4.271672 × 10^6
Engineering notation4.271672 × 10^6
In other bases
Ternary22001000122002base 3; the most digit-efficient integer base after e: 14 digits
Quinary2043143142base 5; one hand: 10 digits
Septenary51210566base 7: 8 digits
Nonary8030562base 9; each digit is two ternary digits: 7 digits
Duodecimal1520048base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal16dj3cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:46:34:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T001001T0T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010111001001001000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000010010111000111000
Bit length23 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits14within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes341 2e 38
Gray code11000011011100100100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000010010111000111000
64-bit0000000000000000000000000000000000000000010000010010111000111000
One's complement11111111101111101101000111000111at 32 bits, every bit flipped
Bits reversed00011100011101001000001000000000at 32 bits
Rotated left by 100000000100000100101110001110000at 32 bits, wrapping
Shifted left by 1100000100101110001110000= 8,543,344, no wrap
Shifted right by 11000001001011100011100= 2,135,836, discarding the low bit
These bits as a double2.11048639 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,271,672 to the power 218,247,181,675,584
4,271,672 to the power 377,945,975,042,505,256,448
4,271,672 to the power 4332,959,639,101,768,513,821,741,056
4,271,672 to the power 51,422,294,367,481,129,710,973,944,260,165,632
First ten multiples4,271,672, 8,543,344, 12,815,016, 17,086,688, 21,358,360, 25,630,032, 29,901,704, 34,173,376, 38,445,048, 42,716,720
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 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 8
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1242the total stopping time
Highest value reached4,271,672
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,271,672 → 2,135,836 → 1,067,918 → 533,959 → 1,601,878 → 800,939 → 2,402,818 → 1,201,409 → 3,604,228 → 1,802,114 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage427,167,200%
4,271,672% as a decimal42,716.72
4,271,672% of 1004,271,672
4,271,672% of 1,00042,716,720
As a fraction of 1004,271,672/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,271,672
Nerdulate something else
Nothing in mind? Surprise me · today’s page