Recognised as Number
3,426,311
- Positive
- Odd
- Composite
- 7 digits
3,426,311 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,426,311
Digit count7
Digit sum20
Digit product432
Multiplicative persistence3times 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 factorisation7 × 37 × 13,229
Distinct prime factors37, 37, 13,229
Number of divisors8
Sum of divisors σ(n)4,021,920
Aliquot sum595,609sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,857,248integers below n that share no factor with it
Carmichael function λ(n)119,052the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,857,248
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 37, 259, 13,229, 92,603, 489,473, 3,426,3118 in total
Arithmetic
Previous number3,426,310
Next number3,426,312
Double6,852,622
Half1,713,155.5
Square11,739,607,068,721
Cube40,223,544,835,236,518,231
Square root1,851.02971343≈irrational, shown to 9 decimal places
Cube root150.756342856≈
Negation-3,426,311
Reciprocal2.91859087 × 10^-7≈
Representations
Decimal3,426,311
Binary110100010010000000011122 bits
Octal15044007
Hexadecimal344807
Base 3621FRB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and twenty-six thousand, three hundred and eleven
Ordinalthree million, four hundred and twenty-six thousand, three hundred and eleventh
Scientific notation3.426311 × 10^6
Engineering notation3.426311 × 10^6
In other bases
Ternary20110002000102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1334120221base 5; one hand: 10 digits
Septenary41060150base 7: 8 digits
Nonary6402012base 9; each digit is two ternary digits: 7 digits
Duodecimal119299bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1185fbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:51:45:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011001T00011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000101100000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101000100100000000111
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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 48 07
Gray code1011100110110000000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101000100100000000111
64-bit0000000000000000000000000000000000000000001101000100100000000111
One's complement11111111110010111011011111111000at 32 bits, every bit flipped
Bits reversed11100000000100100010110000000000at 32 bits
Rotated left by 100000000011010001001000000001110at 32 bits, wrapping
Shifted left by 111010001001000000001110= 6,852,622, no wrap
Shifted right by 1110100010010000000011= 1,713,155, discarding the low bit
These bits as a double1.69282256 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,426,311 to the power 211,739,607,068,721
3,426,311 to the power 340,223,544,835,236,518,231
3,426,311 to the power 4137,818,374,127,964,070,016,575,841
3,426,311 to the power 5472,208,611,276,758,700,702,563,986,352,551
First ten multiples3,426,311, 6,852,622, 10,278,933, 13,705,244, 17,131,555, 20,557,866, 23,984,177, 27,410,488, 30,836,799, 34,263,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 7Yes
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 1102the total stopping time
Highest value reached23,127,6046× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,426,311 → 10,278,934 → 5,139,467 → 15,418,402 → 7,709,201 → 23,127,604 → 11,563,802 → 5,781,901 → 17,345,704 → 8,672,852 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage342,631,100%
3,426,311% as a decimal34,263.11
3,426,311% of 1003,426,311
3,426,311% of 1,00034,263,110
As a fraction of 1003,426,311/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,426,311
Nerdulate something else
Nothing in mind? Surprise me · today’s page