Recognised as Number

1,413,669

Positive
Odd
Composite
7 digits

1,413,669 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,413,669

Digit count7

Digit sum30

Digit product3,888

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 17 × 53 × 523

Distinct prime factors43, 17, 53, 523

Number of divisors16

Sum of divisors σ(n)2,037,312

Aliquot sum623,643sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)54,288the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 868,608

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 17, 51, 53, 159, 523, 901, 1,569, 2,703, 8,891, 26,673, 27,719, 83,157, 471,223, 1,413,66916 in total

Arithmetic

Previous number1,413,668

Next number1,413,670

Double2,827,338

Half706,834.5

Square1,998,460,041,561

Cube2,825,161,008,493,497,309

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

Cube root112.231795667≈

Negation-1,413,669

Reciprocal7.07379167 × 10^-7≈

Representations

Decimal1,413,669

Binary10101100100100010010121 bits

Octal5311045

Hexadecimal159225

Base 36UASL

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

In wordsone million, four hundred and thirteen thousand, six hundred and sixty-nine

Ordinalone million, four hundred and thirteen thousand, six hundred and sixty-ninth

Scientific notation1.413669 × 10^6

Engineering notation1.413669 × 10^6

In other bases

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

Quinary330214134base 5; one hand: 9 digits

Septenary15005325base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101011001001000100101

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes315 92 25

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

At each machine width

32-bit00000000000101011001001000100101

64-bit0000000000000000000000000000000000000000000101011001001000100101

One's complement11111111111010100110110111011010at 32 bits, every bit flipped

Bits reversed10100100010010011010100000000000at 32 bits

Rotated left by 100000000001010110010010001001010at 32 bits, wrapping

Shifted left by 11010110010010001001010= 2,827,338, no wrap

Shifted right by 110101100100100010010= 706,834, discarding the low bit

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

Nearest landmarks

Next prime1,413,673+4

Previous prime1,413,661−8

Distance to nearest prime4

Nearest square below1,411,344

Nearest square above1,413,721

Powers & multiples

1,413,669 to the power 21,998,460,041,561

1,413,669 to the power 32,825,161,008,493,497,309

1,413,669 to the power 43,993,842,537,715,993,847,316,721

1,413,669 to the power 55,645,971,386,450,431,306,142,381,659,349

First ten multiples1,413,669, 2,827,338, 4,241,007, 5,654,676, 7,068,345, 8,482,014, 9,895,683, 11,309,352, 12,723,021, 14,136,690

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 9

Divisible by 11No, remainder 4

Divisible by 12No, remainder 9

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached10,189,9607× the starting value

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

First steps1,413,669 → 4,241,008 → 2,120,504 → 1,060,252 → 530,126 → 265,063 → 795,190 → 397,595 → 1,192,786 → 596,393 → …

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

As a percentage & fraction

As a percentage141,366,900%

1,413,669% as a decimal14,136.69

1,413,669% of 1001,413,669

1,413,669% of 1,00014,136,690

As a fraction of 1001,413,669/100

Read another way

As seconds16 days, 8 hours and 41 minutes

As bytes1.348 MiB

As a 24-bit colour#159225

Keep nerding

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