Recognised as Number
3,360,629
- Positive
- Odd
- Prime
- 7 digits
3,360,629 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,360,629
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation3,360,629
Distinct prime factors13,360,629
Number of divisors2
Sum of divisors σ(n)3,360,630
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,360,628integers below n that share no factor with it
Carmichael function λ(n)3,360,628the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3,360,6292 in total
Arithmetic
Previous number3,360,628
Next number3,360,630
Double6,721,258
Half1,680,314.5
Square11,293,827,275,641
Cube37,954,363,463,510,138,189
Square root1,833.20184377≈irrational, shown to 9 decimal places
Cube root149.786793393≈
Negation-3,360,629
Reciprocal2.97563343 × 10^-7≈
Representations
Decimal3,360,629
Binary110011010001110111010122 bits
Octal14643565
Hexadecimal334775
Base 362012T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and sixty thousand, six hundred and twenty-nine
Ordinalthree million, three hundred and sixty thousand, six hundred and twenty-ninth
Scientific notation3.360629 × 10^6
Engineering notation3.360629 × 10^6
In other bases
Ternary20022201220202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330020004base 5; one hand: 10 digits
Septenary40364516base 7: 8 digits
Nonary6281822base 9; each digit is two ternary digits: 7 digits
Duodecimal1160985base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1101b9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:33:30:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100T1T0T1T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110101100010110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110100011101110101
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
Bytes333 47 75
Gray code1010101110010011001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110100011101110101
64-bit0000000000000000000000000000000000000000001100110100011101110101
One's complement11111111110011001011100010001010at 32 bits, every bit flipped
Bits reversed10101110111000101100110000000000at 32 bits
Rotated left by 100000000011001101000111011101010at 32 bits, wrapping
Shifted left by 111001101000111011101010= 6,721,258, no wrap
Shifted right by 1110011010001110111010= 1,680,314, discarding the low bit
These bits as a double1.66037134 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,360,629 to the power 211,293,827,275,641
3,360,629 to the power 337,954,363,463,510,138,189
3,360,629 to the power 4127,550,534,532,012,612,191,960,881
3,360,629 to the power 5428,650,025,313,783,012,898,057,303,554,149
First ten multiples3,360,629, 6,721,258, 10,081,887, 13,442,516, 16,803,145, 20,163,774, 23,524,403, 26,885,032, 30,245,661, 33,606,290
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 184the total stopping time
Highest value reached10,081,8883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,360,629 → 10,081,888 → 5,040,944 → 2,520,472 → 1,260,236 → 630,118 → 315,059 → 945,178 → 472,589 → 1,417,768 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage336,062,900%
3,360,629% as a decimal33,606.29
3,360,629% of 1003,360,629
3,360,629% of 1,00033,606,290
As a fraction of 1003,360,629/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,360,629
Nerdulate something else
Nothing in mind? Surprise me · today’s page