Recognised as Number
3,446,111
- Positive
- Odd
- Composite
- 7 digits
3,446,111 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,446,111
Digit count7
Digit sum20
Digit product288
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation73 × 47,207
Distinct prime factors273, 47,207
Number of divisors4
Sum of divisors σ(n)3,493,392
Aliquot sum47,281sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,398,832integers below n that share no factor with it
Carmichael function λ(n)1,699,416the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,398,832
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 73, 47,207, 3,446,1114 in total
Arithmetic
Previous number3,446,110
Next number3,446,112
Double6,892,222
Half1,723,055.5
Square11,875,681,024,321
Cube40,924,915,010,403,865,631
Square root1,856.370383302≈irrational, shown to 9 decimal places
Cube root151.046182678≈
Negation-3,446,111
Reciprocal2.90182179 × 10^-7≈
Representations
Decimal3,446,111
Binary110100100101010101111122 bits
Octal15112537
Hexadecimal34955F
Base 3621V1B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and forty-six thousand, one hundred and eleven
Ordinalthree million, four hundred and forty-six thousand, one hundred and eleventh
Scientific notation3.446111 × 10^6
Engineering notation3.446111 × 10^6
In other bases
Ternary20111002011202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1340233421base 5; one hand: 10 digits
Septenary41201654base 7: 8 digits
Nonary6432152base 9; each digit is two ternary digits: 7 digits
Duodecimal11a233bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11af5bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:57:15:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011101T1TTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011110101010100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001001010101011111
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 95 5f
Gray code1011101101111111110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001001010101011111
64-bit0000000000000000000000000000000000000000001101001001010101011111
One's complement11111111110010110110101010100000at 32 bits, every bit flipped
Bits reversed11111010101010010010110000000000at 32 bits
Rotated left by 100000000011010010010101010111110at 32 bits, wrapping
Shifted left by 111010010010101010111110= 6,892,222, no wrap
Shifted right by 1110100100101010101111= 1,723,055, discarding the low bit
These bits as a double1.70260506 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,446,111 to the power 211,875,681,024,321
3,446,111 to the power 340,924,915,010,403,865,631
3,446,111 to the power 4141,031,799,791,417,875,793,511,041
3,446,111 to the power 5486,011,236,611,002,847,368,652,127,011,551
First ten multiples3,446,111, 6,892,222, 10,338,333, 13,784,444, 17,230,555, 20,676,666, 24,122,777, 27,568,888, 31,014,999, 34,461,110
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached229,703,84866× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,446,111 → 10,338,334 → 5,169,167 → 15,507,502 → 7,753,751 → 23,261,254 → 11,630,627 → 34,891,882 → 17,445,941 → 52,337,824 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage344,611,100%
3,446,111% as a decimal34,461.11
3,446,111% of 1003,446,111
3,446,111% of 1,00034,461,110
As a fraction of 1003,446,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,446,111
Nerdulate something else
Nothing in mind? Surprise me · today’s page