Recognised as Number
1,704,483
- Positive
- Odd
- Composite
- 7 digits
1,704,483 is an odd 7-digit integer and a composite number. It has 20 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,704,483
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 11 × 1,913
Distinct prime factors33, 11, 1,913
Number of divisors20
Sum of divisors σ(n)2,779,128
Aliquot sum1,074,645sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,032,480integers below n that share no factor with it
Carmichael function λ(n)258,120the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,032,480
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 11, 27, 33, 81, 99, 297, 891, 1,913, 5,739, 17,217, 21,043, 51,651, 63,129, 154,953, 189,387, 568,161, 1,704,48320 in total
Arithmetic
Previous number1,704,482
Next number1,704,484
Double3,408,966
Half852,241.5
Square2,905,262,297,289
Cube4,951,970,196,270,046,587
Square root1,305.558501179≈irrational, shown to 9 decimal places
Cube root119.453136623≈
Negation-1,704,483
Reciprocal5.86688163 × 10^-7≈
Representations
Decimal1,704,483
Binary11010000000100010001121 bits
Octal6401043
Hexadecimal1A0223
Base 3610J6R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven hundred and four thousand, four hundred and eighty-three
Ordinalone million, seven hundred and four thousand, four hundred and eighty-third
Scientific notation1.704483 × 10^6
Engineering notation1.704483 × 10^6
In other bases
Ternary10012121010000base 3; the most digit-efficient integer base after e: 14 digits
Quinary414020413base 5; one hand: 9 digits
Septenary20326224base 7: 8 digits
Nonary3177100base 9; each digit is two ternary digits: 7 digits
Duodecimal6a2483base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalad143base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:53:28:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T0TT1010000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100000011001100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110100000001000100011
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 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 02 23
Gray code101110000001100110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110100000001000100011
64-bit0000000000000000000000000000000000000000000110100000001000100011
One's complement11111111111001011111110111011100at 32 bits, every bit flipped
Bits reversed11000100010000000101100000000000at 32 bits
Rotated left by 100000000001101000000010001000110at 32 bits, wrapping
Shifted left by 11101000000010001000110= 3,408,966, no wrap
Shifted right by 111010000000100010001= 852,241, discarding the low bit
These bits as a double8.42126494 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,704,483 to the power 22,905,262,297,289
1,704,483 to the power 34,951,970,196,270,046,587
1,704,483 to the power 48,440,549,016,048,957,816,749,521
1,704,483 to the power 514,386,772,308,522,175,766,366,673,802,643
First ten multiples1,704,483, 3,408,966, 5,113,449, 6,817,932, 8,522,415, 10,226,898, 11,931,381, 13,635,864, 15,340,347, 17,044,830
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 83
Collatz (3n + 1) trajectory
Steps to reach 1220the total stopping time
Highest value reached7,670,1764× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,704,483 → 5,113,450 → 2,556,725 → 7,670,176 → 3,835,088 → 1,917,544 → 958,772 → 479,386 → 239,693 → 719,080 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage170,448,300%
1,704,483% as a decimal17,044.83
1,704,483% of 1001,704,483
1,704,483% of 1,00017,044,830
As a fraction of 1001,704,483/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,483
Nerdulate something else
Nothing in mind? Surprise me · today’s page