Recognised as Number

1,738,487

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,738,487

Digit count7

Digit sum38

Digit product37,632

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,738,487

Distinct prime factors11,738,487

Number of divisors2

Sum of divisors σ(n)1,738,488

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,738,486the 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,738,4872 in total

Arithmetic

Previous number1,738,486

Next number1,738,488

Double3,476,974

Half869,243.5

Square3,022,337,049,169

Cube5,254,293,669,598,667,303

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

Cube root120.242265197≈

Negation-1,738,487

Reciprocal5.75212814 × 10^-7≈

Representations

Decimal1,738,487

Binary11010100001101111011121 bits

Octal6503367

Hexadecimal1A86F7

Base 36119FB

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

In wordsone million, seven hundred and thirty-eight thousand, four hundred and eighty-seven

Ordinalone million, seven hundred and thirty-eight thousand, four hundred and eighty-seventh

Scientific notation1.738487 × 10^6

Engineering notation1.738487 × 10^6

In other bases

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

Quinary421112422base 5; one hand: 9 digits

Septenary20530322base 7: 8 digits

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

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

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

Sexagesimal8:2:54:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110101000011011110111

Bit length21 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits8within that length

Bit parityodd13 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 86 f7

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

At each machine width

32-bit00000000000110101000011011110111

64-bit0000000000000000000000000000000000000000000110101000011011110111

One's complement11111111111001010111100100001000at 32 bits, every bit flipped

Bits reversed11101111011000010101100000000000at 32 bits

Rotated left by 100000000001101010000110111101110at 32 bits, wrapping

Shifted left by 11101010000110111101110= 3,476,974, no wrap

Shifted right by 111010100001101111011= 869,243, discarding the low bit

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

Nearest landmarks

Next prime1,738,493+6

Previous prime1,738,459−28

Distance to nearest prime0, it is prime

Nearest square below1,737,124

Nearest square above1,739,761

Powers & multiples

1,738,487 to the power 23,022,337,049,169

1,738,487 to the power 35,254,293,669,598,667,303

1,738,487 to the power 49,134,521,238,779,578,323,590,561

1,738,487 to the power 515,880,246,424,842,192,781,043,983,621,207

First ten multiples1,738,487, 3,476,974, 5,215,461, 6,953,948, 8,692,435, 10,430,922, 12,169,409, 13,907,896, 15,646,383, 17,384,870

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 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 11

Divisible by 100No, remainder 87

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time

Highest value reached11,734,7926× the starting value

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

First steps1,738,487 → 5,215,462 → 2,607,731 → 7,823,194 → 3,911,597 → 11,734,792 → 5,867,396 → 2,933,698 → 1,466,849 → 4,400,548 → …

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

As a percentage & fraction

As a percentage173,848,700%

1,738,487% as a decimal17,384.87

1,738,487% of 1001,738,487

1,738,487% of 1,00017,384,870

As a fraction of 1001,738,487/100

Read another way

As seconds20 days, 2 hours and 54 minutes

As bytes1.658 MiB

As a 24-bit colour#1A86F7

Keep nerding

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