Recognised as Number
3,061,289
- Positive
- Odd
- Composite
- 7 digits
3,061,289 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,061,289
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 factorisation7 × 11 × 83 × 479
Distinct prime factors47, 11, 83, 479
Number of divisors16
Sum of divisors σ(n)3,870,720
Aliquot sum809,431sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,351,760integers below n that share no factor with it
Carmichael function λ(n)293,970the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,351,760
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 11, 77, 83, 479, 581, 913, 3,353, 5,269, 6,391, 36,883, 39,757, 278,299, 437,327, 3,061,28916 in total
Arithmetic
Previous number3,061,288
Next number3,061,290
Double6,122,578
Half1,530,644.5
Square9,371,490,341,521
Cube28,688,840,296,104,480,569
Square root1,749.653965789≈irrational, shown to 9 decimal places
Cube root145.200499483≈
Negation-3,061,289
Reciprocal3.26659783 × 10^-7≈
Representations
Decimal3,061,289
Binary101110101101100010100122 bits
Octal13533051
Hexadecimal2EB629
Base 361TM3T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, sixty-one thousand, two hundred and eighty-nine
Ordinalthree million, sixty-one thousand, two hundred and eighty-ninth
Scientific notation3.061289 × 10^6
Engineering notation3.061289 × 10^6
In other bases
Ternary12202112022002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1240430124base 5; one hand: 10 digits
Septenary35010020base 7: 8 digits
Nonary5675262base 9; each digit is two ternary digits: 7 digits
Duodecimal10376b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalj2d49base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:10:21:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T10TTT10T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100111100101001111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011101011011000101001
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes32e b6 29
Gray code1110011110110100111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011101011011000101001
64-bit0000000000000000000000000000000000000000001011101011011000101001
One's complement11111111110100010100100111010110at 32 bits, every bit flipped
Bits reversed10010100011011010111010000000000at 32 bits
Rotated left by 100000000010111010110110001010010at 32 bits, wrapping
Shifted left by 110111010110110001010010= 6,122,578, no wrap
Shifted right by 1101110101101100010100= 1,530,644, discarding the low bit
These bits as a double1.51247773 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,061,289 to the power 29,371,490,341,521
3,061,289 to the power 328,688,840,296,104,480,569
3,061,289 to the power 487,824,831,221,221,389,216,593,441
3,061,289 to the power 5268,857,189,744,381,605,373,476,118,405,449
First ten multiples3,061,289, 6,122,578, 9,183,867, 12,245,156, 15,306,445, 18,367,734, 21,429,023, 24,490,312, 27,551,601, 30,612,890
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 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1226the total stopping time
Highest value reached198,595,63664× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,061,289 → 9,183,868 → 4,591,934 → 2,295,967 → 6,887,902 → 3,443,951 → 10,331,854 → 5,165,927 → 15,497,782 → 7,748,891 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage306,128,900%
3,061,289% as a decimal30,612.89
3,061,289% of 1003,061,289
3,061,289% of 1,00030,612,890
As a fraction of 1003,061,289/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,061,289
Nerdulate something else
Nothing in mind? Surprise me · today’s page