Recognised as Number
4,431,439
- Positive
- Odd
- Composite
- 7 digits
4,431,439 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,431,439
Digit count7
Digit sum28
Digit product5,184
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation311 × 14,249
Distinct prime factors2311, 14,249
Number of divisors4
Sum of divisors σ(n)4,446,000
Aliquot sum14,561sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,416,880integers below n that share no factor with it
Carmichael function λ(n)2,208,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,416,880
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 311, 14,249, 4,431,4394 in total
Arithmetic
Previous number4,431,438
Next number4,431,440
Double8,862,878
Half2,215,719.5
Square19,637,651,610,721
Cube87,023,055,216,161,857,519
Square root2,105.098334995≈irrational, shown to 9 decimal places
Cube root164.253610686≈
Negation-4,431,439
Reciprocal2.25660333 × 10^-7≈
Representations
Decimal4,431,439
Binary1000011100111100100111123 bits
Octal20717117
Hexadecimal439E4F
Base 362MZBJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and thirty-one thousand, four hundred and thirty-nine
Ordinalfour million, four hundred and thirty-one thousand, four hundred and thirty-ninth
Scientific notation4.431439 × 10^6
Engineering notation4.431439 × 10^6
In other bases
Ternary22100010210101base 3; the most digit-efficient integer base after e: 14 digits
Quinary2113301224base 5; one hand: 10 digits
Septenary52444435base 7: 8 digits
Nonary8303711base 9; each digit is two ternary digits: 7 digits
Duodecimal15985a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal17dibjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:30:57:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T100011T10101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001001110001001010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000111001111001001111
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 set bits, so odd; 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 9e 4f
Gray code11000100101000101101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000111001111001001111
64-bit0000000000000000000000000000000000000000010000111001111001001111
One's complement11111111101111000110000110110000at 32 bits, every bit flipped
Bits reversed11110010011110011100001000000000at 32 bits
Rotated left by 100000000100001110011110010011110at 32 bits, wrapping
Shifted left by 1100001110011110010011110= 8,862,878, no wrap
Shifted right by 11000011100111100100111= 2,215,719, discarding the low bit
These bits as a double2.18942177 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,431,439 to the power 219,637,651,610,721
4,431,439 to the power 387,023,055,216,161,857,519
4,431,439 to the power 4385,637,360,784,053,085,722,139,841
4,431,439 to the power 51,708,928,440,435,523,422,139,433,654,861,199
First ten multiples4,431,439, 8,862,878, 13,294,317, 17,725,756, 22,157,195, 26,588,634, 31,020,073, 35,451,512, 39,882,951, 44,314,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 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1242the total stopping time
Highest value reached44,868,32810× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,431,439 → 13,294,318 → 6,647,159 → 19,941,478 → 9,970,739 → 29,912,218 → 14,956,109 → 44,868,328 → 22,434,164 → 11,217,082 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage443,143,900%
4,431,439% as a decimal44,314.39
4,431,439% of 1004,431,439
4,431,439% of 1,00044,314,390
As a fraction of 1004,431,439/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,431,439
Nerdulate something else
Nothing in mind? Surprise me · today’s page