Recognised as Number

1,664,079

Positive
Odd
Composite
7 digits

1,664,079 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,664,079

Digit count7

Digit sum33

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 17 × 67 × 487

Distinct prime factors43, 17, 67, 487

Number of divisors16

Sum of divisors σ(n)2,389,248

Aliquot sum725,169sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,026,432integers below n that share no factor with it

Carmichael function λ(n)42,768the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,026,432

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 17, 51, 67, 201, 487, 1,139, 1,461, 3,417, 8,279, 24,837, 32,629, 97,887, 554,693, 1,664,07916 in total

Arithmetic

Previous number1,664,078

Next number1,664,080

Double3,328,158

Half832,039.5

Square2,769,158,918,241

Cube4,608,099,203,507,565,039

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

Cube root118.501718005≈

Negation-1,664,079

Reciprocal6.00933009 × 10^-7≈

Representations

Decimal1,664,079

Binary11001011001000100111121 bits

Octal6262117

Hexadecimal19644F

Base 36ZO0F

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

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

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

Scientific notation1.664079 × 10^6

Engineering notation1.664079 × 10^6

In other bases

Ternary10010112200120base 3; the most digit-efficient integer base after e: 14 digits

Quinary411222304base 5; one hand: 9 digits

Septenary20100354base 7: 8 digits

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

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

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

Sexagesimal7:42:14:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110010110010001001111

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes319 64 4f

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

At each machine width

32-bit00000000000110010110010001001111

64-bit0000000000000000000000000000000000000000000110010110010001001111

One's complement11111111111001101001101110110000at 32 bits, every bit flipped

Bits reversed11110010001001101001100000000000at 32 bits

Rotated left by 100000000001100101100100010011110at 32 bits, wrapping

Shifted left by 11100101100100010011110= 3,328,158, no wrap

Shifted right by 111001011001000100111= 832,039, discarding the low bit

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

Nearest landmarks

Next prime1,664,083+4

Previous prime1,664,071−8

Distance to nearest prime4

Nearest square below1,661,521

Nearest square above1,664,100

Powers & multiples

1,664,079 to the power 22,769,158,918,241

1,664,079 to the power 34,608,099,203,507,565,039

1,664,079 to the power 47,668,241,114,473,665,322,534,081

1,664,079 to the power 512,760,559,005,532,222,516,257,190,976,399

First ten multiples1,664,079, 3,328,158, 4,992,237, 6,656,316, 8,320,395, 9,984,474, 11,648,553, 13,312,632, 14,976,711, 16,640,790

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 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 6

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 3

Divisible by 100No, remainder 79

Collatz (3n + 1) trajectory

Steps to reach 1207the total stopping time

Highest value reached16,848,80810× the starting value

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

First steps1,664,079 → 4,992,238 → 2,496,119 → 7,488,358 → 3,744,179 → 11,232,538 → 5,616,269 → 16,848,808 → 8,424,404 → 4,212,202 → …

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

As a percentage & fraction

As a percentage166,407,900%

1,664,079% as a decimal16,640.79

1,664,079% of 1001,664,079

1,664,079% of 1,00016,640,790

As a fraction of 1001,664,079/100

Read another way

As seconds19 days, 6 hours and 14 minutes

As bytes1.587 MiB

As a 24-bit colour#19644F

Keep nerding

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