Recognised as Number
1,950,640
- Positive
- Even
- Composite
- 7 digits
1,950,640 is an even 7-digit integer and a composite number. It has 40 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,950,640
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 5 × 37 × 659
Distinct prime factors42, 5, 37, 659
Number of divisors40
Sum of divisors σ(n)4,664,880
Aliquot sum2,714,240sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)758,016integers below n that share no factor with it
Carmichael function λ(n)11,844the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 758,016
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 37, 40, 74, 80, 148, 185, 296, 370, 592, 659, 740, 1,318, 1,480, 2,636, 2,960, 3,295, 5,272, 6,590, 10,544, 13,180, 24,383, 26,360, 48,766, 52,720, 97,532, 121,915, 195,064, 243,830, 390,128, 487,660, 975,320, 1,950,64040 in total
Arithmetic
Previous number1,950,639
Next number1,950,641
Double3,901,280
Half975,320
Square3,804,996,409,600
Cube7,422,178,196,422,144,000
Square root1,396.653142337≈irrational, shown to 9 decimal places
Cube root124.946964167≈
Negation-1,950,640
Reciprocal5.12652258 × 10^-7≈
Representations
Decimal1,950,640
Binary11101110000111011000021 bits
Octal7341660
Hexadecimal1DC3B0
Base 3615T4G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, nine hundred and fifty thousand, six hundred and forty
Ordinalone million, nine hundred and fifty thousand, six hundred and fortieth
Scientific notation1.95064 × 10^6
Engineering notation1.95064 × 10^6
In other bases
Ternary10200002202221base 3; the most digit-efficient integer base after e: 14 digits
Quinary444410030base 5; one hand: 9 digits
Septenary22402666base 7: 8 digits
Nonary3602687base 9; each digit is two ternary digits: 7 digits
Duodecimal7a0a14base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalc3gc0base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:1:50:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T00010T100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000101100010011110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111011100001110110000
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes31d c3 b0
Gray code100110010001001101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111011100001110110000
64-bit0000000000000000000000000000000000000000000111011100001110110000
One's complement11111111111000100011110001001111at 32 bits, every bit flipped
Bits reversed00001101110000111011100000000000at 32 bits
Rotated left by 100000000001110111000011101100000at 32 bits, wrapping
Shifted left by 11110111000011101100000= 3,901,280, no wrap
Shifted right by 111101110000111011000= 975,320, discarding the low bit
These bits as a double9.63744211 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,950,640 to the power 23,804,996,409,600
1,950,640 to the power 37,422,178,196,422,144,000
1,950,640 to the power 414,477,997,677,068,890,972,160,000
1,950,640 to the power 528,241,361,388,797,661,485,934,182,400,000
First ten multiples1,950,640, 3,901,280, 5,851,920, 7,802,560, 9,753,200, 11,703,840, 13,654,480, 15,605,120, 17,555,760, 19,506,400
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 4
Divisible by 100No, remainder 40
Collatz (3n + 1) trajectory
Steps to reach 1184the total stopping time
Highest value reached1,950,640
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,950,640 → 975,320 → 487,660 → 243,830 → 121,915 → 365,746 → 182,873 → 548,620 → 274,310 → 137,155 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage195,064,000%
1,950,640% as a decimal19,506.4
1,950,640% of 1001,950,640
1,950,640% of 1,00019,506,400
As a fraction of 1001,950,640/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,950,640
Nerdulate something else
Nothing in mind? Surprise me · today’s page