Recognised as Number

1,731,007

Positive
Odd
Prime
7 digits

1,731,007 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,731,007

Digit count7

Digit sum19

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 numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,731,007

Distinct prime factors11,731,007

Number of divisors2

Sum of divisors σ(n)1,731,008

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,731,006the 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,731,0072 in total

Arithmetic

Previous number1,731,006

Next number1,731,008

Double3,462,014

Half865,503.5

Square2,996,385,234,049

Cube5,186,763,814,835,457,343

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

Cube root120.069566145≈

Negation-1,731,007

Reciprocal5.77698415 × 10^-7≈

Representations

Decimal1,731,007

Binary11010011010011011111121 bits

Octal6464677

Hexadecimal1A69BF

Base 36113NJ

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

In wordsone million, seven hundred and thirty-one thousand and seven

Ordinalone million, seven hundred and thirty-one thousand and seventh

Scientific notation1.731007 × 10^6

Engineering notation1.731007 × 10^6

In other bases

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

Quinary420343012base 5; one hand: 9 digits

Septenary20466445base 7: 8 digits

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

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

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

Sexagesimal8:0:50:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110100110100110111111

Bit length21 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits7within that length

Bit parityeven14 set bits, so even; 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 69 bf

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

At each machine width

32-bit00000000000110100110100110111111

64-bit0000000000000000000000000000000000000000000110100110100110111111

One's complement11111111111001011001011001000000at 32 bits, every bit flipped

Bits reversed11111101100101100101100000000000at 32 bits

Rotated left by 100000000001101001101001101111110at 32 bits, wrapping

Shifted left by 11101001101001101111110= 3,462,014, no wrap

Shifted right by 111010011010011011111= 865,503, discarding the low bit

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

Nearest landmarks

Next prime1,731,013+6

Previous prime1,730,999−8

Distance to nearest prime0, it is prime

Nearest square below1,729,225

Nearest square above1,731,856

Powers & multiples

1,731,007 to the power 22,996,385,234,049

1,731,007 to the power 35,186,763,814,835,457,343

1,731,007 to the power 48,978,324,470,826,880,508,934,401

1,731,007 to the power 515,541,542,507,272,625,949,129,010,671,807

First ten multiples1,731,007, 3,462,014, 5,193,021, 6,924,028, 8,655,035, 10,386,042, 12,117,049, 13,848,056, 15,579,063, 17,310,070

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 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 7

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1220the total stopping time

Highest value reached66,545,76438× the starting value

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

First steps1,731,007 → 5,193,022 → 2,596,511 → 7,789,534 → 3,894,767 → 11,684,302 → 5,842,151 → 17,526,454 → 8,763,227 → 26,289,682 → …

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

As a percentage & fraction

As a percentage173,100,700%

1,731,007% as a decimal17,310.07

1,731,007% of 1001,731,007

1,731,007% of 1,00017,310,070

As a fraction of 1001,731,007/100

Read another way

As seconds20 days, 50 minutes and 7 seconds

As bytes1.651 MiB

As a 24-bit colour#1A69BF

Keep nerding

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