Recognised as Number
1,614,376
- Positive
- Even
- Composite
- 7 digits
1,614,376 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,614,376
Digit count7
Digit sum28
Digit product3,024
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 201,797
Distinct prime factors22, 201,797
Number of divisors8
Sum of divisors σ(n)3,026,970
Aliquot sum1,412,594sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)807,184integers below n that share no factor with it
Carmichael function λ(n)201,796the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 807,184
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 201,797, 403,594, 807,188, 1,614,3768 in total
Arithmetic
Previous number1,614,375
Next number1,614,377
Double3,228,752
Half807,188
Square2,606,209,869,376
Cube4,207,402,664,083,749,376
Square root1,270.580969478≈irrational, shown to 9 decimal places
Cube root117.309962919≈
Negation-1,614,376
Reciprocal6.19434382 × 10^-7≈
Representations
Decimal1,614,376
Binary11000101000100010100021 bits
Octal6121050
Hexadecimal18A228
Base 36YLNS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and fourteen thousand, three hundred and seventy-six
Ordinalone million, six hundred and fourteen thousand, three hundred and seventy-sixth
Scientific notation1.614376 × 10^6
Engineering notation1.614376 × 10^6
In other bases
Ternary10001000111201base 3; the most digit-efficient integer base after e: 14 digits
Quinary403130001base 5; one hand: 9 digits
Septenary16502431base 7: 8 digits
Nonary3030451base 9; each digit is two ternary digits: 7 digits
Duodecimal65a2b4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala1figbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:28:26:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10001001TTTT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011110011001111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110001010001000101000
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes318 a2 28
Gray code101001111001100111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110001010001000101000
64-bit0000000000000000000000000000000000000000000110001010001000101000
One's complement11111111111001110101110111010111at 32 bits, every bit flipped
Bits reversed00010100010001010001100000000000at 32 bits
Rotated left by 100000000001100010100010001010000at 32 bits, wrapping
Shifted left by 11100010100010001010000= 3,228,752, no wrap
Shifted right by 111000101000100010100= 807,188, discarding the low bit
These bits as a double7.97607721 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,614,376 to the power 22,606,209,869,376
1,614,376 to the power 34,207,402,664,083,749,376
1,614,376 to the power 46,792,329,883,232,866,982,629,376
1,614,376 to the power 510,965,374,347,573,942,867,949,281,509,376
First ten multiples1,614,376, 3,228,752, 4,843,128, 6,457,504, 8,071,880, 9,686,256, 11,300,632, 12,915,008, 14,529,384, 16,143,760
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 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12No, remainder 4
Divisible by 100No, remainder 76
Collatz (3n + 1) trajectory
Steps to reach 170the total stopping time
Highest value reached1,614,376
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,614,376 → 807,188 → 403,594 → 201,797 → 605,392 → 302,696 → 151,348 → 75,674 → 37,837 → 113,512 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage161,437,600%
1,614,376% as a decimal16,143.76
1,614,376% of 1001,614,376
1,614,376% of 1,00016,143,760
As a fraction of 1001,614,376/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,614,376
Nerdulate something else
Nothing in mind? Surprise me · today’s page