Recognised as Number
3,513,368
- Positive
- Even
- Composite
- 7 digits
3,513,368 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,513,368
Digit count7
Digit sum29
Digit product6,480
Multiplicative persistence2times 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 factorisation2^3 × 439,171
Distinct prime factors22, 439,171
Number of divisors8
Sum of divisors σ(n)6,587,580
Aliquot sum3,074,212sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,756,680integers below n that share no factor with it
Carmichael function λ(n)439,170the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,756,680
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 439,171, 878,342, 1,756,684, 3,513,3688 in total
Arithmetic
Previous number3,513,367
Next number3,513,369
Double7,026,736
Half1,756,684
Square12,343,754,703,424
Cube43,368,152,774,859,372,032
Square root1,874.398036704≈irrational, shown to 9 decimal places
Cube root152.022503593≈
Negation-3,513,368
Reciprocal2.84627173 × 10^-7≈
Representations
Decimal3,513,368
Binary110101100111000001100022 bits
Octal15316030
Hexadecimal359C18
Base 3623AXK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and thirteen thousand, three hundred and sixty-eight
Ordinalthree million, five hundred and thirteen thousand, three hundred and sixty-eighth
Scientific notation3.513368 × 10^6
Engineering notation3.513368 × 10^6
In other bases
Ternary20121111102202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344411433base 5; one hand: 10 digits
Septenary41602025base 7: 8 digits
Nonary6544382base 9; each digit is two ternary digits: 7 digits
Duodecimal1215248base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11j388base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:15:56:8base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT1111110T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101110110001101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101011001110000011000
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes335 9c 18
Gray code1011110101001000010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101011001110000011000
64-bit0000000000000000000000000000000000000000001101011001110000011000
One's complement11111111110010100110001111100111at 32 bits, every bit flipped
Bits reversed00011000001110011010110000000000at 32 bits
Rotated left by 100000000011010110011100000110000at 32 bits, wrapping
Shifted left by 111010110011100000110000= 7,026,736, no wrap
Shifted right by 1110101100111000001100= 1,756,684, discarding the low bit
These bits as a double1.73583443 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,513,368 to the power 212,343,754,703,424
3,513,368 to the power 343,368,152,774,859,372,032
3,513,368 to the power 4152,368,280,178,302,122,197,323,776
3,513,368 to the power 5535,325,839,793,480,970,460,167,040,237,568
First ten multiples3,513,368, 7,026,736, 10,540,104, 14,053,472, 17,566,840, 21,080,208, 24,593,576, 28,106,944, 31,620,312, 35,133,680
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 1
Divisible by 12No, remainder 8
Divisible by 100No, remainder 68
Collatz (3n + 1) trajectory
Steps to reach 1203the total stopping time
Highest value reached15,212,5004× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,513,368 → 1,756,684 → 878,342 → 439,171 → 1,317,514 → 658,757 → 1,976,272 → 988,136 → 494,068 → 247,034 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage351,336,800%
3,513,368% as a decimal35,133.68
3,513,368% of 1003,513,368
3,513,368% of 1,00035,133,680
As a fraction of 1003,513,368/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,513,368
Nerdulate something else
Nothing in mind? Surprise me · today’s page