Recognised as Number
3,471,109
- Positive
- Odd
- Composite
- 7 digits
3,471,109 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 value3,471,109
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation571 × 6,079
Distinct prime factors2571, 6,079
Number of divisors4
Sum of divisors σ(n)3,477,760
Aliquot sum6,651sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,464,460integers below n that share no factor with it
Carmichael function λ(n)577,410the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,464,460
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 571, 6,079, 3,471,1094 in total
Arithmetic
Previous number3,471,108
Next number3,471,110
Double6,942,218
Half1,735,554.5
Square12,048,597,689,881
Cube41,821,995,878,725,148,029
Square root1,863.091248436≈irrational, shown to 9 decimal places
Cube root151.410531467≈
Negation-3,471,109
Reciprocal2.88092365 × 10^-7≈
Representations
Decimal3,471,109
Binary110100111101110000010122 bits
Octal15173405
Hexadecimal34F705
Base 3622EBP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and seventy-one thousand, one hundred and nine
Ordinalthree million, four hundred and seventy-one thousand, one hundred and ninth
Scientific notation3.471109 × 10^6
Engineering notation3.471109 × 10^6
In other bases
Ternary20112100110121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1342033414base 5; one hand: 10 digits
Septenary41334565base 7: 8 digits
Nonary6470417base 9; each digit is two ternary digits: 7 digits
Duodecimal11b48b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11dhf9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:4:11:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTT100111TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010000101100000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001111011100000101
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
Bytes334 f7 05
Gray code1011101000110010000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001111011100000101
64-bit0000000000000000000000000000000000000000001101001111011100000101
One's complement11111111110010110000100011111010at 32 bits, every bit flipped
Bits reversed10100000111011110010110000000000at 32 bits
Rotated left by 100000000011010011110111000001010at 32 bits, wrapping
Shifted left by 111010011110111000001010= 6,942,218, no wrap
Shifted right by 1110100111101110000010= 1,735,554, discarding the low bit
These bits as a double1.71495571 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,471,109 to the power 212,048,597,689,881
3,471,109 to the power 341,821,995,878,725,148,029
3,471,109 to the power 4145,168,706,292,605,769,849,794,161
3,471,109 to the power 5503,896,402,930,620,521,177,549,160,394,549
First ten multiples3,471,109, 6,942,218, 10,413,327, 13,884,436, 17,355,545, 20,826,654, 24,297,763, 27,768,872, 31,239,981, 34,711,090
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached10,413,3283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,471,109 → 10,413,328 → 5,206,664 → 2,603,332 → 1,301,666 → 650,833 → 1,952,500 → 976,250 → 488,125 → 1,464,376 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage347,110,900%
3,471,109% as a decimal34,711.09
3,471,109% of 1003,471,109
3,471,109% of 1,00034,711,090
As a fraction of 1003,471,109/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,471,109
Nerdulate something else
Nothing in mind? Surprise me · today’s page