Recognised as Number
3,172,149
- Positive
- Odd
- Composite
- 7 digits
3,172,149 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,172,149
Digit count7
Digit sum27
Digit product1,512
Multiplicative persistence3times 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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 17 × 6,911
Distinct prime factors33, 17, 6,911
Number of divisors16
Sum of divisors σ(n)4,976,640
Aliquot sum1,804,491sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,990,080integers below n that share no factor with it
Carmichael function λ(n)497,520the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,990,080
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 17, 27, 51, 153, 459, 6,911, 20,733, 62,199, 117,487, 186,597, 352,461, 1,057,383, 3,172,14916 in total
Arithmetic
Previous number3,172,148
Next number3,172,150
Double6,344,298
Half1,586,074.5
Square10,062,529,278,201
Cube31,919,842,187,316,023,949
Square root1,781.052778555≈irrational, shown to 9 decimal places
Cube root146.93249712≈
Negation-3,172,149
Reciprocal3.15243704 × 10^-7≈
Representations
Decimal3,172,149
Binary110000011001110011010122 bits
Octal14063465
Hexadecimal306735
Base 361VZN9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and seventy-two thousand, one hundred and forty-nine
Ordinalthree million, one hundred and seventy-two thousand, one hundred and forty-ninth
Scientific notation3.172149 × 10^6
Engineering notation3.172149 × 10^6
In other bases
Ternary12222011101000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1303002044base 5; one hand: 10 digits
Septenary35651151base 7: 8 digits
Nonary5864330base 9; each digit is two ternary digits: 7 digits
Duodecimal108b899base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaljga79base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:41:9:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T011101000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100011011101101110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100000110011100110101
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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
Bytes330 67 35
Gray code1010000101010010101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100000110011100110101
64-bit0000000000000000000000000000000000000000001100000110011100110101
One's complement11111111110011111001100011001010at 32 bits, every bit flipped
Bits reversed10101100111001100000110000000000at 32 bits
Rotated left by 100000000011000001100111001101010at 32 bits, wrapping
Shifted left by 111000001100111001101010= 6,344,298, no wrap
Shifted right by 1110000011001110011010= 1,586,074, discarding the low bit
These bits as a double1.56724984 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,172,149 to the power 210,062,529,278,201
3,172,149 to the power 331,919,842,187,316,023,949
3,172,149 to the power 4101,254,495,474,652,338,053,796,401
3,172,149 to the power 5321,194,346,565,422,939,505,012,199,635,749
First ten multiples3,172,149, 6,344,298, 9,516,447, 12,688,596, 15,860,745, 19,032,894, 22,205,043, 25,377,192, 28,549,341, 31,721,490
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 176the total stopping time
Highest value reached9,516,4483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,172,149 → 9,516,448 → 4,758,224 → 2,379,112 → 1,189,556 → 594,778 → 297,389 → 892,168 → 446,084 → 223,042 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage317,214,900%
3,172,149% as a decimal31,721.49
3,172,149% of 1003,172,149
3,172,149% of 1,00031,721,490
As a fraction of 1003,172,149/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,172,149
Nerdulate something else
Nothing in mind? Surprise me · today’s page