Recognised as Number
4,343,771
- Positive
- Odd
- Prime
- 7 digits
4,343,771 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,343,771
Digit count7
Digit sum29
Digit product7,056
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,343,771
Distinct prime factors14,343,771
Number of divisors2
Sum of divisors σ(n)4,343,772
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,343,770integers below n that share no factor with it
Carmichael function λ(n)4,343,770the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,343,7712 in total
Arithmetic
Previous number4,343,770
Next number4,343,772
Double8,687,542
Half2,171,885.5
Square18,868,346,500,441
Cube81,959,776,346,567,103,011
Square root2,084.171538046≈irrational, shown to 9 decimal places
Cube root163.163234922≈
Negation-4,343,771
Reciprocal2.30214714 × 10^-7≈
Representations
Decimal4,343,771
Binary1000010010001111101101123 bits
Octal20443733
Hexadecimal4247DB
Base 362L3OB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, three hundred and forty-three thousand, seven hundred and seventy-one
Ordinalfour million, three hundred and forty-three thousand, seven hundred and seventy-first
Scientific notation4.343771 × 10^6
Engineering notation4.343771 × 10^6
In other bases
Ternary22011200112102base 3; the most digit-efficient integer base after e: 14 digits
Quinary2103000041base 5; one hand: 10 digits
Septenary51631025base 7: 8 digits
Nonary8150472base 9; each digit is two ternary digits: 7 digits
Duodecimal155590bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal172j8bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:6:36:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1TTT01TTT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001100101100000101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010000100100011111011011
Bit length23 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits11within that length
Bit parityeven12 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
Bytes342 47 db
Gray code11000110110010000110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010000100100011111011011
64-bit0000000000000000000000000000000000000000010000100100011111011011
One's complement11111111101111011011100000100100at 32 bits, every bit flipped
Bits reversed11011011111000100100001000000000at 32 bits
Rotated left by 100000000100001001000111110110110at 32 bits, wrapping
Shifted left by 1100001001000111110110110= 8,687,542, no wrap
Shifted right by 11000010010001111101101= 2,171,885, discarding the low bit
These bits as a double2.14610802 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,343,771 to the power 218,868,346,500,441
4,343,771 to the power 381,959,776,346,567,103,011
4,343,771 to the power 4356,014,499,660,704,131,613,194,481
4,343,771 to the power 51,546,445,459,205,676,446,481,577,403,927,851
First ten multiples4,343,771, 8,687,542, 13,031,313, 17,375,084, 21,718,855, 26,062,626, 30,406,397, 34,750,168, 39,093,939, 43,437,710
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1273the total stopping time
Highest value reached225,690,13651× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,343,771 → 13,031,314 → 6,515,657 → 19,546,972 → 9,773,486 → 4,886,743 → 14,660,230 → 7,330,115 → 21,990,346 → 10,995,173 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage434,377,100%
4,343,771% as a decimal43,437.71
4,343,771% of 1004,343,771
4,343,771% of 1,00043,437,710
As a fraction of 1004,343,771/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,343,771
Nerdulate something else
Nothing in mind? Surprise me · today’s page