Recognised as Number
3,097,967
- Positive
- Odd
- Composite
- 7 digits
3,097,967 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,097,967
Digit count7
Digit sum41
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,033 × 2,999
Distinct prime factors21,033, 2,999
Number of divisors4
Sum of divisors σ(n)3,102,000
Aliquot sum4,033sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,093,936integers below n that share no factor with it
Carmichael function λ(n)1,546,968the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,093,936
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,033, 2,999, 3,097,9674 in total
Arithmetic
Previous number3,097,966
Next number3,097,968
Double6,195,934
Half1,548,983.5
Square9,597,399,533,089
Cube29,732,427,039,325,130,063
Square root1,760.104258276≈irrational, shown to 9 decimal places
Cube root145.778092239≈
Negation-3,097,967
Reciprocal3.22792334 × 10^-7≈
Representations
Decimal3,097,967
Binary101111010001010110111122 bits
Octal13642557
Hexadecimal2F456F
Base 361UEEN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, ninety-seven thousand, nine hundred and sixty-seven
Ordinalthree million, ninety-seven thousand, nine hundred and sixty-seventh
Scientific notation3.097967 × 10^6
Engineering notation3.097967 × 10^6
In other bases
Ternary12211101121112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1243113332base 5; one hand: 10 digits
Septenary35221655base 7: 8 digits
Nonary5741545base 9; each digit is two ternary digits: 7 digits
Duodecimal105497bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalj74i7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:20:32:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T1111TT0TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110101101010110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011110100010101101111
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
Bytes32f 45 6f
Gray code1110001110011111011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011110100010101101111
64-bit0000000000000000000000000000000000000000001011110100010101101111
One's complement11111111110100001011101010010000at 32 bits, every bit flipped
Bits reversed11110110101000101111010000000000at 32 bits
Rotated left by 100000000010111101000101011011110at 32 bits, wrapping
Shifted left by 110111101000101011011110= 6,195,934, no wrap
Shifted right by 1101111010001010110111= 1,548,983, discarding the low bit
These bits as a double1.53059907 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,097,967 to the power 29,597,399,533,089
3,097,967 to the power 329,732,427,039,325,130,063
3,097,967 to the power 492,110,077,797,736,955,205,881,921
3,097,967 to the power 5285,353,981,384,821,761,908,300,397,154,607
First ten multiples3,097,967, 6,195,934, 9,293,901, 12,391,868, 15,489,835, 18,587,802, 21,685,769, 24,783,736, 27,881,703, 30,979,670
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1182the total stopping time
Highest value reached35,287,79211× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,097,967 → 9,293,902 → 4,646,951 → 13,940,854 → 6,970,427 → 20,911,282 → 10,455,641 → 31,366,924 → 15,683,462 → 7,841,731 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage309,796,700%
3,097,967% as a decimal30,979.67
3,097,967% of 1003,097,967
3,097,967% of 1,00030,979,670
As a fraction of 1003,097,967/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,097,967
Nerdulate something else
Nothing in mind? Surprise me · today’s page