Recognised as Number
4,397,443
- Positive
- Odd
- Composite
- 7 digits
4,397,443 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,397,443
Digit count7
Digit sum34
Digit product36,288
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation31 × 141,853
Distinct prime factors231, 141,853
Number of divisors4
Sum of divisors σ(n)4,539,328
Aliquot sum141,885sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,255,560integers below n that share no factor with it
Carmichael function λ(n)709,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,255,560
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 31, 141,853, 4,397,4434 in total
Arithmetic
Previous number4,397,442
Next number4,397,444
Double8,794,886
Half2,198,721.5
Square19,337,504,938,249
Cube85,035,575,728,168,497,307
Square root2,097.008106804≈irrational, shown to 9 decimal places
Cube root163.832505477≈
Negation-4,397,443
Reciprocal2.27404881 × 10^-7≈
Representations
Decimal4,397,443
Binary1000011000110011000001123 bits
Octal20614603
Hexadecimal431983
Base 362M937
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, three hundred and ninety-seven thousand, four hundred and forty-three
Ordinalfour million, three hundred and ninety-seven thousand, four hundred and forty-third
Scientific notation4.397443 × 10^6
Engineering notation4.397443 × 10^6
In other bases
Ternary22021102011021base 3; the most digit-efficient integer base after e: 14 digits
Quinary2111204233base 5; one hand: 10 digits
Septenary52243351base 7: 8 digits
Nonary8242137base 9; each digit is two ternary digits: 7 digits
Duodecimal1580997base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal179dc3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:21:30:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1T111T0111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001110110111010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000110001100110000011
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 odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes343 19 83
Gray code11000101001010101000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000110001100110000011
64-bit0000000000000000000000000000000000000000010000110001100110000011
One's complement11111111101111001110011001111100at 32 bits, every bit flipped
Bits reversed11000001100110001100001000000000at 32 bits
Rotated left by 100000000100001100011001100000110at 32 bits, wrapping
Shifted left by 1100001100011001100000110= 8,794,886, no wrap
Shifted right by 11000011000110011000001= 2,198,721, discarding the low bit
These bits as a double2.17262552 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,397,443 to the power 219,337,504,938,249
4,397,443 to the power 385,035,575,728,168,497,307
4,397,443 to the power 4373,939,097,236,804,461,303,186,001
4,397,443 to the power 51,644,375,865,570,305,120,726,466,157,795,443
First ten multiples4,397,443, 8,794,886, 13,192,329, 17,589,772, 21,987,215, 26,384,658, 30,782,101, 35,179,544, 39,576,987, 43,974,430
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1136the total stopping time
Highest value reached19,788,4964× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,397,443 → 13,192,330 → 6,596,165 → 19,788,496 → 9,894,248 → 4,947,124 → 2,473,562 → 1,236,781 → 3,710,344 → 1,855,172 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage439,744,300%
4,397,443% as a decimal43,974.43
4,397,443% of 1004,397,443
4,397,443% of 1,00043,974,430
As a fraction of 1004,397,443/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,397,443
Nerdulate something else
Nothing in mind? Surprise me · today’s page