Recognised as Number
7,743,371
- Positive
- Odd
- Prime
- 7 digits
7,743,371 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value7,743,371
Digit count7
Digit sum32
Digit product12,348
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7,743,371
Distinct prime factors17,743,371
Number of divisors2
Sum of divisors σ(n)7,743,372
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)7,743,370integers below n that share no factor with it
Carmichael function λ(n)7,743,370the 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, 7,743,3712 in total
Arithmetic
Previous number7,743,370
Next number7,743,372
Double15,486,742
Half3,871,685.5
Square59,959,794,443,641
Cube464,290,933,460,850,853,811
Square root2,782.691323162≈irrational, shown to 9 decimal places
Cube root197.838141027≈
Negation-7,743,371
Reciprocal1.29142721 × 10^-7≈
Representations
Decimal7,743,371
Binary1110110001001111000101123 bits
Octal35423613
Hexadecimal76278B
Base 364LYTN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven million, seven hundred and forty-three thousand, three hundred and seventy-one
Ordinalseven million, seven hundred and forty-three thousand, three hundred and seventy-first
Scientific notation7.743371 × 10^6
Engineering notation7.743371 × 10^6
In other bases
Ternary112120101220112base 3; the most digit-efficient integer base after e: 15 digits
Quinary3440241441base 5; one hand: 10 digits
Septenary122550266base 7: 9 digits
Nonary15511815base 9; each digit is two ternary digits: 8 digits
Duodecimal271514bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal287i8bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal35:50:56:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT0TT011T0T1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010100111100010011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000011101100010011110001011
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
Bytes376 27 8b
Gray code10011010011010001001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000011101100010011110001011
64-bit0000000000000000000000000000000000000000011101100010011110001011
One's complement11111111100010011101100001110100at 32 bits, every bit flipped
Bits reversed11010001111001000110111000000000at 32 bits
Rotated left by 100000000111011000100111100010110at 32 bits, wrapping
Shifted left by 1111011000100111100010110= 15,486,742, no wrap
Shifted right by 11110110001001111000101= 3,871,685, discarding the low bit
These bits as a double3.82573359 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
7,743,371 to the power 259,959,794,443,641
7,743,371 to the power 3464,290,933,460,850,853,811
7,743,371 to the power 43,595,176,949,723,682,136,725,336,881
7,743,371 to the power 527,838,788,932,358,818,270,737,008,569,565,851
First ten multiples7,743,371, 15,486,742, 23,230,113, 30,973,484, 38,716,855, 46,460,226, 54,203,597, 61,946,968, 69,690,339, 77,433,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 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1111the total stopping time
Highest value reached34,845,1724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps7,743,371 → 23,230,114 → 11,615,057 → 34,845,172 → 17,422,586 → 8,711,293 → 26,133,880 → 13,066,940 → 6,533,470 → 3,266,735 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage774,337,100%
7,743,371% as a decimal77,433.71
7,743,371% of 1007,743,371
7,743,371% of 1,00077,433,710
As a fraction of 1007,743,371/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 7,743,371
Nerdulate something else
Nothing in mind? Surprise me · today’s page