Recognised as Number
3,471,111
- Positive
- Odd
- Composite
- 7 digits
3,471,111 is an odd 7-digit integer and a composite number. It has 36 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,471,111
Digit count7
Digit sum18
Digit product84
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 7^2 × 17 × 463
Distinct prime factors43, 7, 17, 463
Number of divisors36
Sum of divisors σ(n)6,188,832
Aliquot sum2,717,721sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,862,784integers below n that share no factor with it
Carmichael function λ(n)3,696the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,862,784
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 17, 21, 49, 51, 63, 119, 147, 153, 357, 441, 463, 833, 1,071, 1,389, 2,499, 3,241, 4,167, 7,497, 7,871, 9,723, 22,687, 23,613, 29,169, 55,097, 68,061, 70,839, 165,291, 204,183, 385,679, 495,873, 1,157,037, 3,471,11136 in total
Arithmetic
Previous number3,471,110
Next number3,471,112
Double6,942,222
Half1,735,555.5
Square12,048,611,574,321
Cube41,822,068,170,352,940,631
Square root1,863.091785179≈irrational, shown to 9 decimal places
Cube root151.410560548≈
Negation-3,471,111
Reciprocal2.88092199 × 10^-7≈
Representations
Decimal3,471,111
Binary110100111101110000011122 bits
Octal15173407
Hexadecimal34F707
Base 3622EBR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and seventy-one thousand, one hundred and eleven
Ordinalthree million, four hundred and seventy-one thousand, one hundred and eleventh
Scientific notation3.471111 × 10^6
Engineering notation3.471111 × 10^6
In other bases
Ternary20112100110200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1342033421base 5; one hand: 10 digits
Septenary41334600base 7: 8 digits
Nonary6470420base 9; each digit is two ternary digits: 7 digits
Duodecimal11b48b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11dhfbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:4:11:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TTT100111T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010000101100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001111011100000111
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; 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 07
Gray code1011101000110010000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001111011100000111
64-bit0000000000000000000000000000000000000000001101001111011100000111
One's complement11111111110010110000100011111000at 32 bits, every bit flipped
Bits reversed11100000111011110010110000000000at 32 bits
Rotated left by 100000000011010011110111000001110at 32 bits, wrapping
Shifted left by 111010011110111000001110= 6,942,222, no wrap
Shifted right by 1110100111101110000011= 1,735,555, discarding the low bit
These bits as a double1.7149567 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,471,111 to the power 212,048,611,574,321
3,471,111 to the power 341,822,068,170,352,940,631
3,471,111 to the power 4145,169,040,868,861,966,106,611,041
3,471,111 to the power 5503,897,854,619,356,328,034,284,757,136,551
First ten multiples3,471,111, 6,942,222, 10,413,333, 13,884,444, 17,355,555, 20,826,666, 24,297,777, 27,768,888, 31,239,999, 34,711,110
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 7Yes
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached23,430,0046× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,471,111 → 10,413,334 → 5,206,667 → 15,620,002 → 7,810,001 → 23,430,004 → 11,715,002 → 5,857,501 → 17,572,504 → 8,786,252 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage347,111,100%
3,471,111% as a decimal34,711.11
3,471,111% of 1003,471,111
3,471,111% of 1,00034,711,110
As a fraction of 1003,471,111/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,111
Nerdulate something else
Nothing in mind? Surprise me · today’s page