Recognised as Number
3,016,971
- Positive
- Odd
- Composite
- 7 digits
3,016,971 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,016,971
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 101 × 3,319
Distinct prime factors33, 101, 3,319
Number of divisors12
Sum of divisors σ(n)4,402,320
Aliquot sum1,385,349sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,990,800integers below n that share no factor with it
Carmichael function λ(n)165,900the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,990,800
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 101, 303, 909, 3,319, 9,957, 29,871, 335,219, 1,005,657, 3,016,97112 in total
Arithmetic
Previous number3,016,970
Next number3,016,972
Double6,033,942
Half1,508,485.5
Square9,102,114,014,841
Cube27,460,814,021,468,866,611
Square root1,736.943004246≈irrational, shown to 9 decimal places
Cube root144.496406004≈
Negation-3,016,971
Reciprocal3.31458274 × 10^-7≈
Representations
Decimal3,016,971
Binary101110000010010000101122 bits
Octal13404413
Hexadecimal2E090B
Base 361SNWR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, sixteen thousand, nine hundred and seventy-one
Ordinalthree million, sixteen thousand, nine hundred and seventy-first
Scientific notation3.016971 × 10^6
Engineering notation3.016971 × 10^6
In other bases
Ternary12200021111200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1233020341base 5; one hand: 10 digits
Septenary34433556base 7: 8 digits
Nonary5607450base 9; each digit is two ternary digits: 7 digits
Duodecimal1015b23base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalih28bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:58:2:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0010TTTTT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100001100100011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011100000100100001011
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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
Bytes32e 09 0b
Gray code1110010000110110001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011100000100100001011
64-bit0000000000000000000000000000000000000000001011100000100100001011
One's complement11111111110100011111011011110100at 32 bits, every bit flipped
Bits reversed11010000100100000111010000000000at 32 bits
Rotated left by 100000000010111000001001000010110at 32 bits, wrapping
Shifted left by 110111000001001000010110= 6,033,942, no wrap
Shifted right by 1101110000010010000101= 1,508,485, discarding the low bit
These bits as a double1.49058173 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,016,971 to the power 29,102,114,014,841
3,016,971 to the power 327,460,814,021,468,866,611
3,016,971 to the power 482,848,479,539,164,947,968,255,281
3,016,971 to the power 5249,951,460,163,754,012,236,735,103,373,851
First ten multiples3,016,971, 6,033,942, 9,050,913, 12,067,884, 15,084,855, 18,101,826, 21,118,797, 24,135,768, 27,152,739, 30,169,710
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Highest value reached13,576,3724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,016,971 → 9,050,914 → 4,525,457 → 13,576,372 → 6,788,186 → 3,394,093 → 10,182,280 → 5,091,140 → 2,545,570 → 1,272,785 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage301,697,100%
3,016,971% as a decimal30,169.71
3,016,971% of 1003,016,971
3,016,971% of 1,00030,169,710
As a fraction of 1003,016,971/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,016,971
Nerdulate something else
Nothing in mind? Surprise me · today’s page