Recognised as Number
4,339,572
- Positive
- Even
- Composite
- 7 digits
4,339,572 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,339,572
Digit count7
Digit sum33
Digit product22,680
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 83 × 4,357
Distinct prime factors42, 3, 83, 4,357
Number of divisors24
Sum of divisors σ(n)10,250,016
Aliquot sum5,910,444sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,428,768integers below n that share no factor with it
Carmichael function λ(n)178,596the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,428,768
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 83, 166, 249, 332, 498, 996, 4,357, 8,714, 13,071, 17,428, 26,142, 52,284, 361,631, 723,262, 1,084,893, 1,446,524, 2,169,786, 4,339,57224 in total
Arithmetic
Previous number4,339,571
Next number4,339,573
Double8,679,144
Half2,169,786
Square18,831,885,143,184
Cube81,722,321,474,577,277,248
Square root2,083.16393978≈irrational, shown to 9 decimal places
Cube root163.110642884≈
Negation-4,339,572
Reciprocal2.30437472 × 10^-7≈
Representations
Decimal4,339,572
Binary1000010001101110111010023 bits
Octal20433564
Hexadecimal423774
Base 362L0FO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, three hundred and thirty-nine thousand, five hundred and seventy-two
Ordinalfour million, three hundred and thirty-nine thousand, five hundred and seventy-second
Scientific notation4.339572 × 10^6
Engineering notation4.339572 × 10^6
In other bases
Ternary22011110202220base 3; the most digit-efficient integer base after e: 14 digits
Quinary2102331242base 5; one hand: 10 digits
Septenary51612546base 7: 8 digits
Nonary8143686base 9; each digit is two ternary digits: 7 digits
Duodecimal15533b0base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1728icbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:5:26:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T011111T100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001100100100010110100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000100011011101110100
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes342 37 74
Gray code11000110010110011001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000100011011101110100
64-bit0000000000000000000000000000000000000000010000100011011101110100
One's complement11111111101111011100100010001011at 32 bits, every bit flipped
Bits reversed00101110111011000100001000000000at 32 bits
Rotated left by 100000000100001000110111011101000at 32 bits, wrapping
Shifted left by 1100001000110111011101000= 8,679,144, no wrap
Shifted right by 11000010001101110111010= 2,169,786, discarding the low bit
These bits as a double2.14403344 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,339,572 to the power 218,831,885,143,184
4,339,572 to the power 381,722,321,474,577,277,248
4,339,572 to the power 4354,639,898,046,074,264,181,657,856
4,339,572 to the power 51,538,985,371,643,598,586,763,325,345,477,632
First ten multiples4,339,572, 8,679,144, 13,018,716, 17,358,288, 21,697,860, 26,037,432, 30,377,004, 34,716,576, 39,056,148, 43,395,720
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 174the total stopping time
Highest value reached4,339,572
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,339,572 → 2,169,786 → 1,084,893 → 3,254,680 → 1,627,340 → 813,670 → 406,835 → 1,220,506 → 610,253 → 1,830,760 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage433,957,200%
4,339,572% as a decimal43,395.72
4,339,572% of 1004,339,572
4,339,572% of 1,00043,395,720
As a fraction of 1004,339,572/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,339,572
Nerdulate something else
Nothing in mind? Surprise me · today’s page