Recognised as Number
3,149,939
- Positive
- Odd
- Composite
- 7 digits
3,149,939 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,149,939
Digit count7
Digit sum38
Digit product26,244
Multiplicative persistence6times 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 factorisation13 × 337 × 719
Distinct prime factors313, 337, 719
Number of divisors8
Sum of divisors σ(n)3,407,040
Aliquot sum257,101sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,894,976integers below n that share no factor with it
Carmichael function λ(n)120,624the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,894,976
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 337, 719, 4,381, 9,347, 242,303, 3,149,9398 in total
Arithmetic
Previous number3,149,938
Next number3,149,940
Double6,299,878
Half1,574,969.5
Square9,922,115,703,721
Cube31,254,059,217,663,223,019
Square root1,774.806750044≈irrational, shown to 9 decimal places
Cube root146.588774641≈
Negation-3,149,939
Reciprocal3.17466465 × 10^-7≈
Representations
Decimal3,149,939
Binary110000000100000111001122 bits
Octal14010163
Hexadecimal301073
Base 361VIIB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and forty-nine thousand, nine hundred and thirty-nine
Ordinalthree million, one hundred and forty-nine thousand, nine hundred and thirty-ninth
Scientific notation3.149939 × 10^6
Engineering notation3.149939 × 10^6
In other bases
Ternary12221000220102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1301244224base 5; one hand: 10 digits
Septenary35526332base 7: 8 digits
Nonary5830812base 9; each digit is two ternary digits: 7 digits
Duodecimal107aa6bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaljdegjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:34:58:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T10010T011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100000001000110110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100000001000001110011
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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
Bytes330 10 73
Gray code1010000001100001001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100000001000001110011
64-bit0000000000000000000000000000000000000000001100000001000001110011
One's complement11111111110011111110111110001100at 32 bits, every bit flipped
Bits reversed11001110000010000000110000000000at 32 bits
Rotated left by 100000000011000000010000011100110at 32 bits, wrapping
Shifted left by 111000000010000011100110= 6,299,878, no wrap
Shifted right by 1110000000100000111001= 1,574,969, discarding the low bit
These bits as a double1.55627665 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,149,939 to the power 29,922,115,703,721
3,149,939 to the power 331,254,059,217,663,223,019
3,149,939 to the power 498,448,380,038,026,875,053,245,841
3,149,939 to the power 5310,106,391,768,602,336,778,346,151,153,699
First ten multiples3,149,939, 6,299,878, 9,449,817, 12,599,756, 15,749,695, 18,899,634, 22,049,573, 25,199,512, 28,349,451, 31,499,390
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1102the total stopping time
Highest value reached14,174,7284× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,149,939 → 9,449,818 → 4,724,909 → 14,174,728 → 7,087,364 → 3,543,682 → 1,771,841 → 5,315,524 → 2,657,762 → 1,328,881 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage314,993,900%
3,149,939% as a decimal31,499.39
3,149,939% of 1003,149,939
3,149,939% of 1,00031,499,390
As a fraction of 1003,149,939/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,149,939
Nerdulate something else
Nothing in mind? Surprise me · today’s page