Recognised as Number
4,397,191
- Positive
- Odd
- Composite
- 7 digits
4,397,191 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,191
Digit count7
Digit sum34
Digit product6,804
Multiplicative persistence2times 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 factorisation37 × 118,843
Distinct prime factors237, 118,843
Number of divisors4
Sum of divisors σ(n)4,516,072
Aliquot sum118,881sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,278,312integers below n that share no factor with it
Carmichael function λ(n)713,052the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,278,312
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 37, 118,843, 4,397,1914 in total
Arithmetic
Previous number4,397,190
Next number4,397,192
Double8,794,382
Half2,198,595.5
Square19,335,288,690,481
Cube85,020,957,412,184,838,871
Square root2,096.948020338≈irrational, shown to 9 decimal places
Cube root163.829375887≈
Negation-4,397,191
Reciprocal2.27417913 × 10^-7≈
Representations
Decimal4,397,191
Binary1000011000110001000011123 bits
Octal20614207
Hexadecimal431887
Base 362M8W7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, three hundred and ninety-seven thousand, one hundred and ninety-one
Ordinalfour million, three hundred and ninety-seven thousand, one hundred and ninety-first
Scientific notation4.397191 × 10^6
Engineering notation4.397191 × 10^6
In other bases
Ternary22021101210221base 3; the most digit-efficient integer base after e: 14 digits
Quinary2111202231base 5; one hand: 10 digits
Septenary52242541base 7: 8 digits
Nonary8241727base 9; each digit is two ternary digits: 7 digits
Duodecimal1580807base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal179cjbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:21:26:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1T111TT110T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001110110100110011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000110001100010000111
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 18 87
Gray code11000101001010011000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000110001100010000111
64-bit0000000000000000000000000000000000000000010000110001100010000111
One's complement11111111101111001110011101111000at 32 bits, every bit flipped
Bits reversed11100001000110001100001000000000at 32 bits
Rotated left by 100000000100001100011000100001110at 32 bits, wrapping
Shifted left by 1100001100011000100001110= 8,794,382, no wrap
Shifted right by 11000011000110001000011= 2,198,595, discarding the low bit
These bits as a double2.17250101 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,397,191 to the power 219,335,288,690,481
4,397,191 to the power 385,020,957,412,184,838,871
4,397,191 to the power 4373,853,388,744,242,463,820,011,361
4,397,191 to the power 51,643,904,756,305,684,263,727,179,576,486,951
First ten multiples4,397,191, 8,794,382, 13,191,573, 17,588,764, 21,985,955, 26,383,146, 30,780,337, 35,177,528, 39,574,719, 43,971,910
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1211the total stopping time
Highest value reached29,681,0446× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,397,191 → 13,191,574 → 6,595,787 → 19,787,362 → 9,893,681 → 29,681,044 → 14,840,522 → 7,420,261 → 22,260,784 → 11,130,392 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage439,719,100%
4,397,191% as a decimal43,971.91
4,397,191% of 1004,397,191
4,397,191% of 1,00043,971,910
As a fraction of 1004,397,191/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,191
Nerdulate something else
Nothing in mind? Surprise me · today’s page