Recognised as Number
1,949,426
- Positive
- Even
- Composite
- 7 digits
1,949,426 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,949,426
Digit count7
Digit sum35
Digit product15,552
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 974,713
Distinct prime factors22, 974,713
Number of divisors4
Sum of divisors σ(n)2,924,142
Aliquot sum974,716sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)974,712integers below n that share no factor with it
Carmichael function λ(n)974,712the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 974,713, 1,949,4264 in total
Arithmetic
Previous number1,949,425
Next number1,949,427
Double3,898,852
Half974,713
Square3,800,261,729,476
Cube7,408,329,022,245,480,776
Square root1,396.218464281≈irrational, shown to 9 decimal places
Cube root124.921038131≈
Negation-1,949,426
Reciprocal5.12971511 × 10^-7≈
Representations
Decimal1,949,426
Binary11101101111101111001021 bits
Octal7337362
Hexadecimal1DBEF2
Base 3615S6Q
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and forty-nine thousand, four hundred and twenty-six
Ordinalone million, nine hundred and forty-nine thousand, four hundred and twenty-sixth
Scientific notation1.949426 × 10^6
Engineering notation1.949426 × 10^6
In other bases
Ternary10200001002222base 3; the most digit-efficient integer base after e: 14 digits
Quinary444340201base 5; one hand: 9 digits
Septenary22366313base 7: 8 digits
Nonary3601088base 9; each digit is two ternary digits: 7 digits
Duodecimal7a0182base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc3db6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:1:30:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T0000101000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000101100001100110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111011011111011110010
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes31d be f2
Gray code100110110000110001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111011011111011110010
64-bit0000000000000000000000000000000000000000000111011011111011110010
One's complement11111111111000100100000100001101at 32 bits, every bit flipped
Bits reversed01001111011111011011100000000000at 32 bits
Rotated left by 100000000001110110111110111100100at 32 bits, wrapping
Shifted left by 11110110111110111100100= 3,898,852, no wrap
Shifted right by 111101101111101111001= 974,713, discarding the low bit
These bits as a double9.63144416 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,949,426 to the power 23,800,261,729,476
1,949,426 to the power 37,408,329,022,245,480,776
1,949,426 to the power 414,441,989,212,519,918,607,234,576
1,949,426 to the power 528,153,589,262,605,854,850,826,870,553,376
First ten multiples1,949,426, 3,898,852, 5,848,278, 7,797,704, 9,747,130, 11,696,556, 13,645,982, 15,595,408, 17,544,834, 19,494,260
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 26
Collatz (3n + 1) trajectory
Steps to reach 1153the total stopping time
Highest value reached8,326,9604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,949,426 → 974,713 → 2,924,140 → 1,462,070 → 731,035 → 2,193,106 → 1,096,553 → 3,289,660 → 1,644,830 → 822,415 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage194,942,600%
1,949,426% as a decimal19,494.26
1,949,426% of 1001,949,426
1,949,426% of 1,00019,494,260
As a fraction of 1001,949,426/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 1,949,426
Nerdulate something else
Nothing in mind? Surprise me · today’s page