Recognised as Number
6,147,471
- Positive
- Odd
- Composite
- 7 digits
6,147,471 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value6,147,471
Digit count7
Digit sum30
Digit product4,704
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 11 × 107 × 1,741
Distinct prime factors43, 11, 107, 1,741
Number of divisors16
Sum of divisors σ(n)9,030,528
Aliquot sum2,883,057sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,688,800integers below n that share no factor with it
Carmichael function λ(n)92,220the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,688,800
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 107, 321, 1,177, 1,741, 3,531, 5,223, 19,151, 57,453, 186,287, 558,861, 2,049,157, 6,147,47116 in total
Arithmetic
Previous number6,147,470
Next number6,147,472
Double12,294,942
Half3,073,735.5
Square37,791,399,695,841
Cube232,321,533,679,591,368,111
Square root2,479.409405483≈irrational, shown to 9 decimal places
Cube root183.188762794≈
Negation-6,147,471
Reciprocal1.62668518 × 10^-7≈
Representations
Decimal6,147,471
Binary1011101110011011000111123 bits
Octal27346617
Hexadecimal5DCD8F
Base 363NRF3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix million, one hundred and forty-seven thousand, four hundred and seventy-one
Ordinalsix million, one hundred and forty-seven thousand, four hundred and seventy-first
Scientific notation6.147471 × 10^6
Engineering notation6.147471 × 10^6
In other bases
Ternary102120022202010base 3; the most digit-efficient integer base after e: 15 digits
Quinary3033204341base 5; one hand: 10 digits
Septenary103152441base 7: 9 digits
Nonary12508663base 9; each digit is two ternary digits: 8 digits
Duodecimal2085693base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1i88dbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal28:27:37:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110TT0100T1T010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000101101001010010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010111011100110110001111
Bit length23 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits8within that length
Bit parityodd15 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
Bytes35d cd 8f
Gray code11100110010101101001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010111011100110110001111
64-bit0000000000000000000000000000000000000000010111011100110110001111
One's complement11111111101000100011001001110000at 32 bits, every bit flipped
Bits reversed11110001101100111011101000000000at 32 bits
Rotated left by 100000000101110111001101100011110at 32 bits, wrapping
Shifted left by 1101110111001101100011110= 12,294,942, no wrap
Shifted right by 11011101110011011000111= 3,073,735, discarding the low bit
These bits as a double3.03725423 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
6,147,471 to the power 237,791,399,695,841
6,147,471 to the power 3232,321,533,679,591,368,111
6,147,471 to the power 41,428,189,890,970,811,227,312,697,281
6,147,471 to the power 58,779,755,937,236,223,866,379,214,466,726,351
First ten multiples6,147,471, 12,294,942, 18,442,413, 24,589,884, 30,737,355, 36,884,826, 43,032,297, 49,179,768, 55,327,239, 61,474,710
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
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 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1152the total stopping time
Highest value reached62,243,15210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps6,147,471 → 18,442,414 → 9,221,207 → 27,663,622 → 13,831,811 → 41,495,434 → 20,747,717 → 62,243,152 → 31,121,576 → 15,560,788 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage614,747,100%
6,147,471% as a decimal61,474.71
6,147,471% of 1006,147,471
6,147,471% of 1,00061,474,710
As a fraction of 1006,147,471/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 6,147,471
Nerdulate something else
Nothing in mind? Surprise me · today’s page