Recognised as Number

1,414,536

Positive
Even
Composite
7 digits

1,414,536 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,414,536

Digit count7

Digit sum24

Digit product1,440

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 3 × 17 × 3,467

Distinct prime factors42, 3, 17, 3,467

Number of divisors32

Sum of divisors σ(n)3,745,440

Aliquot sum2,330,904sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)443,648integers below n that share no factor with it

Carmichael function λ(n)27,728the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 443,648

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 12, 17, 24, 34, 51, 68, 102, 136, 204, 408, 3,467, 6,934, 10,401, 13,868, 20,802, 27,736, 41,604, 58,939, 83,208, 117,878, 176,817, 235,756, 353,634, 471,512, 707,268, 1,414,53632 in total

Arithmetic

Previous number1,414,535

Next number1,414,537

Double2,829,072

Half707,268

Square2,000,912,095,296

Cube2,830,362,191,631,622,656

Square root1,189.342675599≈irrational, shown to 9 decimal places

Cube root112.254734813≈

Negation-1,414,536

Reciprocal7.06945599 × 10^-7≈

Representations

Decimal1,414,536

Binary10101100101011000100021 bits

Octal5312610

Hexadecimal159588

Base 36UBGO

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, four hundred and fourteen thousand, five hundred and thirty-six

Ordinalone million, four hundred and fourteen thousand, five hundred and thirty-sixth

Scientific notation1.414536 × 10^6

Engineering notation1.414536 × 10^6

In other bases

Ternary2122212101020base 3; the most digit-efficient integer base after e: 13 digits

Quinary330231121base 5; one hand: 9 digits

Septenary15011004base 7: 8 digits

Nonary2585336base 9; each digit is two ternary digits: 7 digits

Duodecimal582720base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal8gg6gbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal6:32:55:36base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary10T000TT1011T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11010101110101010011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101011001010110001000

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 33 trailing zeros

Power of twoNo

Bytes315 95 88

Gray code111110101111101001100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101011001010110001000

64-bit0000000000000000000000000000000000000000000101011001010110001000

One's complement11111111111010100110101001110111at 32 bits, every bit flipped

Bits reversed00010001101010011010100000000000at 32 bits

Rotated left by 100000000001010110010101100010000at 32 bits, wrapping

Shifted left by 11010110010101100010000= 2,829,072, no wrap

Shifted right by 110101100101011000100= 707,268, discarding the low bit

These bits as a double6.98873642 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,414,549+13

Previous prime1,414,513−23

Distance to nearest prime13

Nearest square below1,413,721

Nearest square above1,416,100

Powers & multiples

1,414,536 to the power 22,000,912,095,296

1,414,536 to the power 32,830,362,191,631,622,656

1,414,536 to the power 44,003,649,213,101,828,985,327,616

1,414,536 to the power 55,663,305,943,304,208,765,589,384,626,176

First ten multiples1,414,536, 2,829,072, 4,243,608, 5,658,144, 7,072,680, 8,487,216, 9,901,752, 11,316,288, 12,730,824, 14,145,360

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 1

Divisible by 6Yes

Divisible by 7No, remainder 4

Divisible by 8Yes

Divisible by 9No, remainder 6

Divisible by 10No, remainder 6

Divisible by 11No, remainder 2

Divisible by 12Yes

Divisible by 100No, remainder 36

Collatz (3n + 1) trajectory

Steps to reach 1124the total stopping time

Highest value reached1,414,536

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,414,536 → 707,268 → 353,634 → 176,817 → 530,452 → 265,226 → 132,613 → 397,840 → 198,920 → 99,460 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage141,453,600%

1,414,536% as a decimal14,145.36

1,414,536% of 1001,414,536

1,414,536% of 1,00014,145,360

As a fraction of 1001,414,536/100

Read another way

As seconds16 days, 8 hours and 55 minutes

As bytes1.349 MiB

As a 24-bit colour#159588

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.