Recognised as Number
3,360,631
- Positive
- Odd
- Composite
- 7 digits
3,360,631 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,360,631
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation971 × 3,461
Distinct prime factors2971, 3,461
Number of divisors4
Sum of divisors σ(n)3,365,064
Aliquot sum4,433sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,356,200integers below n that share no factor with it
Carmichael function λ(n)335,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,356,200
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 971, 3,461, 3,360,6314 in total
Arithmetic
Previous number3,360,630
Next number3,360,632
Double6,721,262
Half1,680,315.5
Square11,293,840,718,161
Cube37,954,431,226,514,119,591
Square root1,833.202389263≈irrational, shown to 9 decimal places
Cube root149.786823107≈
Negation-3,360,631
Reciprocal2.97563166 × 10^-7≈
Representations
Decimal3,360,631
Binary110011010001110111011122 bits
Octal14643567
Hexadecimal334777
Base 362012V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and sixty thousand, six hundred and thirty-one
Ordinalthree million, three hundred and sixty thousand, six hundred and thirty-first
Scientific notation3.360631 × 10^6
Engineering notation3.360631 × 10^6
In other bases
Ternary20022201220211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330020011base 5; one hand: 10 digits
Septenary40364521base 7: 8 digits
Nonary6281824base 9; each digit is two ternary digits: 7 digits
Duodecimal1160987base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1101bbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:33:30:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100T1T0T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110101100010001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110100011101110111
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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
Bytes333 47 77
Gray code1010101110010011001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110100011101110111
64-bit0000000000000000000000000000000000000000001100110100011101110111
One's complement11111111110011001011100010001000at 32 bits, every bit flipped
Bits reversed11101110111000101100110000000000at 32 bits
Rotated left by 100000000011001101000111011101110at 32 bits, wrapping
Shifted left by 111001101000111011101110= 6,721,262, no wrap
Shifted right by 1110011010001110111011= 1,680,315, discarding the low bit
These bits as a double1.66037233 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,360,631 to the power 211,293,840,718,161
3,360,631 to the power 337,954,431,226,514,119,591
3,360,631 to the power 4127,550,838,167,191,372,235,221,921
3,360,631 to the power 5428,651,300,820,646,508,466,226,079,592,151
First ten multiples3,360,631, 6,721,262, 10,081,893, 13,442,524, 16,803,155, 20,163,786, 23,524,417, 26,885,048, 30,245,679, 33,606,310
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached22,684,2646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,360,631 → 10,081,894 → 5,040,947 → 15,122,842 → 7,561,421 → 22,684,264 → 11,342,132 → 5,671,066 → 2,835,533 → 8,506,600 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage336,063,100%
3,360,631% as a decimal33,606.31
3,360,631% of 1003,360,631
3,360,631% of 1,00033,606,310
As a fraction of 1003,360,631/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,631
Nerdulate something else
Nothing in mind? Surprise me · today’s page