Recognised as Number

1,710,001

Positive
Odd
Composite
7 digits

1,710,001 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,710,001

Digit count7

Digit sum10

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation47 × 36,383

Distinct prime factors247, 36,383

Number of divisors4

Sum of divisors σ(n)1,746,432

Aliquot sum36,431sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)836,786the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,673,572

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

SquarefreeYesno repeated prime factor

All divisors1, 47, 36,383, 1,710,0014 in total

Arithmetic

Previous number1,710,000

Next number1,710,002

Double3,420,002

Half855,000.5

Square2,924,103,420,001

Cube5,000,219,772,305,130,001

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

Cube root119.581901453≈

Negation-1,710,001

Reciprocal5.8479498 × 10^-7≈

Representations

Decimal1,710,001

Binary11010000101111011000121 bits

Octal6413661

Hexadecimal1A17B1

Base 3610NG1

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

In wordsone million, seven hundred and ten thousand and one

Ordinalone million, seven hundred and ten thousand and first

Scientific notation1.710001 × 10^6

Engineering notation1.710001 × 10^6

In other bases

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

Quinary414210001base 5; one hand: 9 digits

Septenary20351266base 7: 8 digits

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

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

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

Sexagesimal7:55:0:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110100001011110110001

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

Bytes31a 17 b1

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

At each machine width

32-bit00000000000110100001011110110001

64-bit0000000000000000000000000000000000000000000110100001011110110001

One's complement11111111111001011110100001001110at 32 bits, every bit flipped

Bits reversed10001101111010000101100000000000at 32 bits

Rotated left by 100000000001101000010111101100010at 32 bits, wrapping

Shifted left by 11101000010111101100010= 3,420,002, no wrap

Shifted right by 111010000101111011000= 855,000, discarding the low bit

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

Nearest landmarks

Next prime1,710,011+10

Previous prime1,709,999−2

Distance to nearest prime2

Nearest square below1,708,249

Nearest square above1,710,864

Powers & multiples

1,710,001 to the power 22,924,103,420,001

1,710,001 to the power 35,000,219,772,305,130,001

1,710,001 to the power 48,550,380,810,861,544,606,840,001

1,710,001 to the power 514,621,159,736,954,052,139,241,008,550,001

First ten multiples1,710,001, 3,420,002, 5,130,003, 6,840,004, 8,550,005, 10,260,006, 11,970,007, 13,680,008, 15,390,009, 17,100,010

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 1101the total stopping time

Highest value reached5,130,0043× the starting value

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

First steps1,710,001 → 5,130,004 → 2,565,002 → 1,282,501 → 3,847,504 → 1,923,752 → 961,876 → 480,938 → 240,469 → 721,408 → …

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

As a percentage & fraction

As a percentage171,000,100%

1,710,001% as a decimal17,100.01

1,710,001% of 1001,710,001

1,710,001% of 1,00017,100,010

As a fraction of 1001,710,001/100

Read another way

As seconds19 days, 19 hours and 1 second

As bytes1.631 MiB

As a 24-bit colour#1A17B1

Keep nerding

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