Recognised as Number
2,949,959
- Positive
- Odd
- Composite
- 7 digits
2,949,959 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 value2,949,959
Digit count7
Digit sum47
Digit product262,440
Multiplicative persistence2times 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 factorisation17 × 19 × 9,133
Distinct prime factors317, 19, 9,133
Number of divisors8
Sum of divisors σ(n)3,288,240
Aliquot sum338,281sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,630,016integers below n that share no factor with it
Carmichael function λ(n)109,584the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,630,016
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 19, 323, 9,133, 155,261, 173,527, 2,949,9598 in total
Arithmetic
Previous number2,949,958
Next number2,949,960
Double5,899,918
Half1,474,979.5
Square8,702,258,101,681
Cube25,671,304,607,376,781,079
Square root1,717.544468129≈irrational, shown to 9 decimal places
Cube root143.418549771≈
Negation-2,949,959
Reciprocal3.38987762 × 10^-7≈
Representations
Decimal2,949,959
Binary101101000000110100011122 bits
Octal13201507
Hexadecimal2D0347
Base 361R87B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and forty-nine thousand, nine hundred and fifty-nine
Ordinaltwo million, nine hundred and forty-nine thousand, nine hundred and fifty-ninth
Scientific notation2.949959 × 10^6
Engineering notation2.949959 × 10^6
In other bases
Ternary12112212120202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1223344314base 5; one hand: 10 digits
Septenary34034315base 7: 8 digits
Nonary5485522base 9; each digit is two ternary digits: 7 digits
Duodecimalba319bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimali8ehjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:39:25:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0TT00T0TT1T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010000011101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011010000001101000111
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes32d 03 47
Gray code1110111000001011100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011010000001101000111
64-bit0000000000000000000000000000000000000000001011010000001101000111
One's complement11111111110100101111110010111000at 32 bits, every bit flipped
Bits reversed11100010110000001011010000000000at 32 bits
Rotated left by 100000000010110100000011010001110at 32 bits, wrapping
Shifted left by 110110100000011010001110= 5,899,918, no wrap
Shifted right by 1101101000000110100011= 1,474,979, discarding the low bit
These bits as a double1.4574734 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,949,959 to the power 28,702,258,101,681
2,949,959 to the power 325,671,304,607,376,781,079
2,949,959 to the power 475,729,296,068,272,601,735,025,761
2,949,959 to the power 5223,398,318,500,265,375,941,654,858,893,799
First ten multiples2,949,959, 5,899,918, 8,849,877, 11,799,836, 14,749,795, 17,699,754, 20,649,713, 23,599,672, 26,549,631, 29,499,590
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 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1195the total stopping time
Highest value reached28,351,6009× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,949,959 → 8,849,878 → 4,424,939 → 13,274,818 → 6,637,409 → 19,912,228 → 9,956,114 → 4,978,057 → 14,934,172 → 7,467,086 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage294,995,900%
2,949,959% as a decimal29,499.59
2,949,959% of 1002,949,959
2,949,959% of 1,00029,499,590
As a fraction of 1002,949,959/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 2,949,959
Nerdulate something else
Nothing in mind? Surprise me · today’s page