Recognised as Number
3,129,189
- Positive
- Odd
- Composite
- 7 digits
3,129,189 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,129,189
Digit count7
Digit sum33
Digit product3,888
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 7^3 × 3,041
Distinct prime factors33, 7, 3,041
Number of divisors16
Sum of divisors σ(n)4,867,200
Aliquot sum1,738,011sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,787,520integers below n that share no factor with it
Carmichael function λ(n)446,880the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,787,520
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 21, 49, 147, 343, 1,029, 3,041, 9,123, 21,287, 63,861, 149,009, 447,027, 1,043,063, 3,129,18916 in total
Arithmetic
Previous number3,129,188
Next number3,129,190
Double6,258,378
Half1,564,594.5
Square9,791,823,797,721
Cube30,640,467,317,766,778,269
Square root1,768.951384295≈irrational, shown to 9 decimal places
Cube root146.266184198≈
Negation-3,129,189
Reciprocal3.19571621 × 10^-7≈
Representations
Decimal3,129,189
Binary101111101111110110010122 bits
Octal13737545
Hexadecimal2FBF65
Base 361V2HX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and twenty-nine thousand, one hundred and eighty-nine
Ordinalthree million, one hundred and twenty-nine thousand, one hundred and eighty-ninth
Scientific notation3.129189 × 10^6
Engineering notation3.129189 × 10^6
In other bases
Ternary12212222102220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1300113224base 5; one hand: 10 digits
Septenary35412000base 7: 8 digits
Nonary5788386base 9; each digit is two ternary digits: 7 digits
Duodecimal106aa59base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaljb2j9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:29:13:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T000T1100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100001100000010100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011111011111101100101
Bit length22 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits6within that length
Bit parityeven16 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 bf 65
Gray code1110000110000011010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011111011111101100101
64-bit0000000000000000000000000000000000000000001011111011111101100101
One's complement11111111110100000100000010011010at 32 bits, every bit flipped
Bits reversed10100110111111011111010000000000at 32 bits
Rotated left by 100000000010111110111111011001010at 32 bits, wrapping
Shifted left by 110111110111111011001010= 6,258,378, no wrap
Shifted right by 1101111101111110110010= 1,564,594, discarding the low bit
These bits as a double1.54602478 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,129,189 to the power 29,791,823,797,721
3,129,189 to the power 330,640,467,317,766,778,269
3,129,189 to the power 495,879,813,285,615,307,124,793,841
3,129,189 to the power 5300,026,057,055,401,277,286,526,514,524,949
First ten multiples3,129,189, 6,258,378, 9,387,567, 12,516,756, 15,645,945, 18,775,134, 21,904,323, 25,033,512, 28,162,701, 31,291,890
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 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached9,387,5683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,129,189 → 9,387,568 → 4,693,784 → 2,346,892 → 1,173,446 → 586,723 → 1,760,170 → 880,085 → 2,640,256 → 1,320,128 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage312,918,900%
3,129,189% as a decimal31,291.89
3,129,189% of 1003,129,189
3,129,189% of 1,00031,291,890
As a fraction of 1003,129,189/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,129,189
Nerdulate something else
Nothing in mind? Surprise me · today’s page