Recognised as Number
1,704,487
- Positive
- Odd
- Prime
- 7 digits
1,704,487 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,704,487
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,704,487
Distinct prime factors11,704,487
Number of divisors2
Sum of divisors σ(n)1,704,488
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,704,486integers below n that share no factor with it
Carmichael function λ(n)1,704,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,704,4872 in total
Arithmetic
Previous number1,704,486
Next number1,704,488
Double3,408,974
Half852,243.5
Square2,905,275,933,169
Cube4,952,005,059,499,429,303
Square root1,305.560033089≈irrational, shown to 9 decimal places
Cube root119.453230065≈
Negation-1,704,487
Reciprocal5.86686786 × 10^-7≈
Representations
Decimal1,704,487
Binary11010000000100010011121 bits
Octal6401047
Hexadecimal1A0227
Base 3610J6V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven hundred and four thousand, four hundred and eighty-seven
Ordinalone million, seven hundred and four thousand, four hundred and eighty-seventh
Scientific notation1.704487 × 10^6
Engineering notation1.704487 × 10^6
In other bases
Ternary10012121010011base 3; the most digit-efficient integer base after e: 14 digits
Quinary414020422base 5; one hand: 9 digits
Septenary20326231base 7: 8 digits
Nonary3177104base 9; each digit is two ternary digits: 7 digits
Duodecimal6a2487base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalad147base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:53:28:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T0TT1010011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100000011001111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110100000001000100111
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 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 02 27
Gray code101110000001100110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110100000001000100111
64-bit0000000000000000000000000000000000000000000110100000001000100111
One's complement11111111111001011111110111011000at 32 bits, every bit flipped
Bits reversed11100100010000000101100000000000at 32 bits
Rotated left by 100000000001101000000010001001110at 32 bits, wrapping
Shifted left by 11101000000010001001110= 3,408,974, no wrap
Shifted right by 111010000000100010011= 852,243, discarding the low bit
These bits as a double8.4212847 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,704,487 to the power 22,905,275,933,169
1,704,487 to the power 34,952,005,059,499,429,303
1,704,487 to the power 48,440,628,247,851,003,754,382,561
1,704,487 to the power 514,386,941,120,294,813,836,296,268,251,207
First ten multiples1,704,487, 3,408,974, 5,113,461, 6,817,948, 8,522,435, 10,226,922, 11,931,409, 13,635,896, 15,340,383, 17,044,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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1127the total stopping time
Highest value reached12,943,4567× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,704,487 → 5,113,462 → 2,556,731 → 7,670,194 → 3,835,097 → 11,505,292 → 5,752,646 → 2,876,323 → 8,628,970 → 4,314,485 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage170,448,700%
1,704,487% as a decimal17,044.87
1,704,487% of 1001,704,487
1,704,487% of 1,00017,044,870
As a fraction of 1001,704,487/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,704,487
Nerdulate something else
Nothing in mind? Surprise me · today’s page