Recognised as Number

1,715,797

Positive
Odd
Prime
7 digits

1,715,797 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,715,797

Digit count7

Digit sum37

Digit product15,435

Multiplicative persistence3times 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 factorisation1,715,797

Distinct prime factors11,715,797

Number of divisors2

Sum of divisors σ(n)1,715,798

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,715,796the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 1,715,7972 in total

Arithmetic

Previous number1,715,796

Next number1,715,798

Double3,431,594

Half857,898.5

Square2,943,959,345,209

Cube5,051,236,612,631,566,573

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

Cube root119.716855584≈

Negation-1,715,797

Reciprocal5.82819529 × 10^-7≈

Representations

Decimal1,715,797

Binary11010001011100101010121 bits

Octal6427125

Hexadecimal1A2E55

Base 3610RX1

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

In wordsone million, seven hundred and fifteen thousand, seven hundred and ninety-seven

Ordinalone million, seven hundred and fifteen thousand, seven hundred and ninety-seventh

Scientific notation1.715797 × 10^6

Engineering notation1.715797 × 10^6

In other bases

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

Quinary414401142base 5; one hand: 9 digits

Septenary20404216base 7: 8 digits

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

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

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

Sexagesimal7:56:36:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110100010111001010101

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 2e 55

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

At each machine width

32-bit00000000000110100010111001010101

64-bit0000000000000000000000000000000000000000000110100010111001010101

One's complement11111111111001011101000110101010at 32 bits, every bit flipped

Bits reversed10101010011101000101100000000000at 32 bits

Rotated left by 100000000001101000101110010101010at 32 bits, wrapping

Shifted left by 11101000101110010101010= 3,431,594, no wrap

Shifted right by 111010001011100101010= 857,898, discarding the low bit

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

Nearest landmarks

Next prime1,715,807+10

Previous prime1,715,789−8

Distance to nearest prime0, it is prime

Nearest square below1,713,481

Nearest square above1,716,100

Powers & multiples

1,715,797 to the power 22,943,959,345,209

1,715,797 to the power 35,051,236,612,631,566,573

1,715,797 to the power 48,666,896,626,243,404,031,253,681

1,715,797 to the power 514,870,635,230,618,553,906,612,972,098,757

First ten multiples1,715,797, 3,431,594, 5,147,391, 6,863,188, 8,578,985, 10,294,782, 12,010,579, 13,726,376, 15,442,173, 17,157,970

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 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 1127the total stopping time

Highest value reached5,147,3923× the starting value

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

First steps1,715,797 → 5,147,392 → 2,573,696 → 1,286,848 → 643,424 → 321,712 → 160,856 → 80,428 → 40,214 → 20,107 → …

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

As a percentage & fraction

As a percentage171,579,700%

1,715,797% as a decimal17,157.97

1,715,797% of 1001,715,797

1,715,797% of 1,00017,157,970

As a fraction of 1001,715,797/100

Read another way

As seconds19 days, 20 hours and 36 minutes

As bytes1.636 MiB

As a 24-bit colour#1A2E55

Keep nerding

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