Recognised as Number
3,947,271
- Positive
- Odd
- Composite
- 7 digits
3,947,271 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,947,271
Digit count7
Digit sum33
Digit product10,584
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 37 × 43 × 827
Distinct prime factors43, 37, 43, 827
Number of divisors16
Sum of divisors σ(n)5,537,664
Aliquot sum1,590,393sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,497,824integers below n that share no factor with it
Carmichael function λ(n)14,868the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,497,824
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 37, 43, 111, 129, 827, 1,591, 2,481, 4,773, 30,599, 35,561, 91,797, 106,683, 1,315,757, 3,947,27116 in total
Arithmetic
Previous number3,947,270
Next number3,947,272
Double7,894,542
Half1,973,635.5
Square15,580,948,347,441
Cube61,502,225,564,351,783,511
Square root1,986.774018352≈irrational, shown to 9 decimal places
Cube root158.039500352≈
Negation-3,947,271
Reciprocal2.53339586 × 10^-7≈
Representations
Decimal3,947,271
Binary111100001110110000011122 bits
Octal17035407
Hexadecimal3C3B07
Base 362CLQF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and forty-seven thousand, two hundred and seventy-one
Ordinalthree million, nine hundred and forty-seven thousand, two hundred and seventy-first
Scientific notation3.947271 × 10^6
Engineering notation3.947271 × 10^6
In other bases
Ternary21102112122020base 3; the most digit-efficient integer base after e: 14 digits
Quinary2002303041base 5; one hand: 10 digits
Septenary45360036base 7: 8 digits
Nonary7375566base 9; each digit is two ternary digits: 7 digits
Duodecimal13a4373base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14d83bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:16:27:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1110TT0T0T1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011000100111100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111000011101100000111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes33c 3b 07
Gray code1000100010011010000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111000011101100000111
64-bit0000000000000000000000000000000000000000001111000011101100000111
One's complement11111111110000111100010011111000at 32 bits, every bit flipped
Bits reversed11100000110111000011110000000000at 32 bits
Rotated left by 100000000011110000111011000001110at 32 bits, wrapping
Shifted left by 111110000111011000001110= 7,894,542, no wrap
Shifted right by 1111100001110110000011= 1,973,635, discarding the low bit
These bits as a double1.950211 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,947,271 to the power 215,580,948,347,441
3,947,271 to the power 361,502,225,564,351,783,511
3,947,271 to the power 4242,765,951,405,624,428,851,248,481
3,947,271 to the power 5958,262,999,770,830,544,896,096,442,845,351
First ten multiples3,947,271, 7,894,542, 11,841,813, 15,789,084, 19,736,355, 23,683,626, 27,630,897, 31,578,168, 35,525,439, 39,472,710
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1172the total stopping time
Highest value reached54,752,27213× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,947,271 → 11,841,814 → 5,920,907 → 17,762,722 → 8,881,361 → 26,644,084 → 13,322,042 → 6,661,021 → 19,983,064 → 9,991,532 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage394,727,100%
3,947,271% as a decimal39,472.71
3,947,271% of 1003,947,271
3,947,271% of 1,00039,472,710
As a fraction of 1003,947,271/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 3,947,271
Nerdulate something else
Nothing in mind? Surprise me · today’s page