Recognised as Number
4,432,639
- Positive
- Odd
- Composite
- 7 digits
4,432,639 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,432,639
Digit count7
Digit sum31
Digit product15,552
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,003 × 2,213
Distinct prime factors22,003, 2,213
Number of divisors4
Sum of divisors σ(n)4,436,856
Aliquot sum4,217sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,428,424integers below n that share no factor with it
Carmichael function λ(n)316,316the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,428,424
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2,003, 2,213, 4,432,6394 in total
Arithmetic
Previous number4,432,638
Next number4,432,640
Double8,865,278
Half2,216,319.5
Square19,648,288,504,321
Cube87,093,769,907,504,933,119
Square root2,105.383338017≈irrational, shown to 9 decimal places
Cube root164.268435558≈
Negation-4,432,639
Reciprocal2.25599242 × 10^-7≈
Representations
Decimal4,432,639
Binary1000011101000101111111123 bits
Octal20721377
Hexadecimal43A2FF
Base 362N08V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and thirty-two thousand, six hundred and thirty-nine
Ordinalfour million, four hundred and thirty-two thousand, six hundred and thirty-ninth
Scientific notation4.432639 × 10^6
Engineering notation4.432639 × 10^6
In other bases
Ternary22100012102211base 3; the most digit-efficient integer base after e: 14 digits
Quinary2113321024base 5; one hand: 10 digits
Septenary52451101base 7: 8 digits
Nonary8305384base 9; each digit is two ternary digits: 7 digits
Duodecimal1599227base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal17e1bjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:31:17:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1001TT110T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001001110011100000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000111010001011111111
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes343 a2 ff
Gray code11000100111001110000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000111010001011111111
64-bit0000000000000000000000000000000000000000010000111010001011111111
One's complement11111111101111000101110100000000at 32 bits, every bit flipped
Bits reversed11111111010001011100001000000000at 32 bits
Rotated left by 100000000100001110100010111111110at 32 bits, wrapping
Shifted left by 1100001110100010111111110= 8,865,278, no wrap
Shifted right by 11000011101000101111111= 2,216,319, discarding the low bit
These bits as a double2.19001465 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,432,639 to the power 219,648,288,504,321
4,432,639 to the power 387,093,769,907,504,933,119
4,432,639 to the power 4386,055,241,149,032,759,235,671,041
4,432,639 to the power 51,711,243,518,071,607,420,865,645,647,507,199
First ten multiples4,432,639, 8,865,278, 13,297,917, 17,730,556, 22,163,195, 26,595,834, 31,028,473, 35,461,112, 39,893,751, 44,326,390
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1149the total stopping time
Highest value reached227,207,42851× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,432,639 → 13,297,918 → 6,648,959 → 19,946,878 → 9,973,439 → 29,920,318 → 14,960,159 → 44,880,478 → 22,440,239 → 67,320,718 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage443,263,900%
4,432,639% as a decimal44,326.39
4,432,639% of 1004,432,639
4,432,639% of 1,00044,326,390
As a fraction of 1004,432,639/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,432,639
Nerdulate something else
Nothing in mind? Surprise me · today’s page