Recognised as Number

1,729,711

Positive
Odd
Prime
7 digits

1,729,711 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,729,711

Digit count7

Digit sum28

Digit product882

Multiplicative persistence4times 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,729,711

Distinct prime factors11,729,711

Number of divisors2

Sum of divisors σ(n)1,729,712

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,729,710the 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,729,7112 in total

Arithmetic

Previous number1,729,710

Next number1,729,712

Double3,459,422

Half864,855.5

Square2,991,900,143,521

Cube5,175,122,589,149,852,431

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

Cube root120.039593416≈

Negation-1,729,711

Reciprocal5.7813126 × 10^-7≈

Representations

Decimal1,729,711

Binary11010011001001010111121 bits

Octal6462257

Hexadecimal1A64AF

Base 36112NJ

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

In wordsone million, seven hundred and twenty-nine thousand, seven hundred and eleven

Ordinalone million, seven hundred and twenty-nine thousand, seven hundred and eleventh

Scientific notation1.729711 × 10^6

Engineering notation1.729711 × 10^6

In other bases

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

Quinary420322321base 5; one hand: 9 digits

Septenary20462614base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000110100110010010101111

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 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 64 af

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

At each machine width

32-bit00000000000110100110010010101111

64-bit0000000000000000000000000000000000000000000110100110010010101111

One's complement11111111111001011001101101010000at 32 bits, every bit flipped

Bits reversed11110101001001100101100000000000at 32 bits

Rotated left by 100000000001101001100100101011110at 32 bits, wrapping

Shifted left by 11101001100100101011110= 3,459,422, no wrap

Shifted right by 111010011001001010111= 864,855, discarding the low bit

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

Nearest landmarks

Next prime1,729,723+12

Previous prime1,729,709−2

Distance to nearest prime0, it is prime

Nearest square below1,729,225

Nearest square above1,731,856

Powers & multiples

1,729,711 to the power 22,991,900,143,521

1,729,711 to the power 35,175,122,589,149,852,431

1,729,711 to the power 48,951,466,468,800,980,398,277,441

1,729,711 to the power 515,483,450,017,216,212,605,684,870,749,551

First ten multiples1,729,711, 3,459,422, 5,189,133, 6,918,844, 8,648,555, 10,378,266, 12,107,977, 13,837,688, 15,567,399, 17,297,110

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 7

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time

Highest value reached17,513,33210× the starting value

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

First steps1,729,711 → 5,189,134 → 2,594,567 → 7,783,702 → 3,891,851 → 11,675,554 → 5,837,777 → 17,513,332 → 8,756,666 → 4,378,333 → …

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

As a percentage & fraction

As a percentage172,971,100%

1,729,711% as a decimal17,297.11

1,729,711% of 1001,729,711

1,729,711% of 1,00017,297,110

As a fraction of 1001,729,711/100

Read another way

As seconds20 days, 28 minutes and 31 seconds

As bytes1.65 MiB

As a 24-bit colour#1A64AF

Keep nerding

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