Recognised as Number
1,414,724
- Positive
- Even
- Composite
- 7 digits
1,414,724 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,414,724
Digit count7
Digit sum23
Digit product896
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 353,681
Distinct prime factors22, 353,681
Number of divisors6
Sum of divisors σ(n)2,475,774
Aliquot sum1,061,050sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)707,360integers below n that share no factor with it
Carmichael function λ(n)353,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 707,360
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 353,681, 707,362, 1,414,7246 in total
Arithmetic
Previous number1,414,723
Next number1,414,725
Double2,829,448
Half707,362
Square2,001,443,996,176
Cube2,831,490,856,046,095,424
Square root1,189.421708226≈irrational, shown to 9 decimal places
Cube root112.259707694≈
Negation-1,414,724
Reciprocal7.06851654 × 10^-7≈
Representations
Decimal1,414,724
Binary10101100101100100010021 bits
Octal5313104
Hexadecimal159644
Base 36UBLW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and fourteen thousand, seven hundred and twenty-four
Ordinalone million, four hundred and fourteen thousand, seven hundred and twenty-fourth
Scientific notation1.414724 × 10^6
Engineering notation1.414724 × 10^6
In other bases
Ternary2122212122012base 3; the most digit-efficient integer base after e: 13 digits
Quinary330232344base 5; one hand: 9 digits
Septenary15011363base 7: 8 digits
Nonary2585565base 9; each digit is two ternary digits: 7 digits
Duodecimal582858base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8ggg4base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:32:58:44base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T000T0T0T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101110101001000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101011001011001000100
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes315 96 44
Gray code111110101110101100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101011001011001000100
64-bit0000000000000000000000000000000000000000000101011001011001000100
One's complement11111111111010100110100110111011at 32 bits, every bit flipped
Bits reversed00100010011010011010100000000000at 32 bits
Rotated left by 100000000001010110010110010001000at 32 bits, wrapping
Shifted left by 11010110010110010001000= 2,829,448, no wrap
Shifted right by 110101100101100100010= 707,362, discarding the low bit
These bits as a double6.98966527 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,414,724 to the power 22,001,443,996,176
1,414,724 to the power 32,831,490,856,046,095,424
1,414,724 to the power 44,005,778,069,828,956,302,622,976
1,414,724 to the power 55,667,070,374,060,700,376,271,987,098,624
First ten multiples1,414,724, 2,829,448, 4,244,172, 5,658,896, 7,073,620, 8,488,344, 9,903,068, 11,317,792, 12,732,516, 14,147,240
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 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10No, remainder 4
Divisible by 11No, remainder 3
Divisible by 12No, remainder 8
Divisible by 100No, remainder 24
Collatz (3n + 1) trajectory
Steps to reach 1106the total stopping time
Highest value reached1,414,724
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,414,724 → 707,362 → 353,681 → 1,061,044 → 530,522 → 265,261 → 795,784 → 397,892 → 198,946 → 99,473 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage141,472,400%
1,414,724% as a decimal14,147.24
1,414,724% of 1001,414,724
1,414,724% of 1,00014,147,240
As a fraction of 1001,414,724/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,414,724
Nerdulate something else
Nothing in mind? Surprise me · today’s page