Nerdulator> put something in

Recognised as Number

1,734,002

  • Positive
  • Even
  • Composite
  • 7 digits

1,734,002 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,734,002
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 867,001
Distinct prime factors22, 867,001
Number of divisors4
Sum of divisors σ(n)2,601,006
Aliquot sum867,004sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)867,000integers below n that share no factor with it
Carmichael function λ(n)867,000the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 867,001, 1,734,0024 in total

Arithmetic

Previous number1,734,001
Next number1,734,003
Double3,468,004
Cube5,213,732,944,556,808,008
Square root1,316.815097119≈irrational, shown to 9 decimal places
Cube root120.138774637≈
Negation-1,734,002
Reciprocal5.76700604 × 10^-7≈

Representations

Decimal1,734,002
Binary11010011101010111001021 bits
Octal6472562
Hexadecimal1A7572
Base 36115YQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seven hundred and thirty-four thousand and two
Ordinalone million, seven hundred and thirty-four thousand and second
Scientific notation1.734002 × 10^6
Engineering notation1.734002 × 10^6

In other bases

Ternary10021002121022base 3; the most digit-efficient integer base after e: 14 digits
Quinary420442002base 5; one hand: 9 digits
Septenary20511254base 7: 8 digits
Nonary3232538base 9; each digit is two ternary digits: 7 digits
Duodecimal6b7582base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalagf02base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal8:1:40:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101T1010TT110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011111000101010110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000110100111010101110010
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes31a 75 72
Gray code101110100111111001011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000110100111010101110010
64-bit0000000000000000000000000000000000000000000110100111010101110010
One's complement11111111111001011000101010001101at 32 bits, every bit flipped
Bits reversed01001110101011100101100000000000at 32 bits
Rotated left by 100000000001101001110101011100100at 32 bits, wrapping
Shifted left by 11101001110101011100100= 3,468,004, no wrap
Shifted right by 111010011101010111001= 867,001, discarding the low bit
These bits as a double8.56710818 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,734,011+9
Previous prime1,733,999−3
Distance to nearest prime3
Nearest square below1,731,856
Nearest square above1,734,489

Powers & multiples

1,734,002 to the power 23,006,762,936,004
1,734,002 to the power 35,213,732,944,556,808,008
1,734,002 to the power 49,040,623,353,327,394,199,488,016
1,734,002 to the power 515,676,458,975,916,408,196,700,618,720,032
First ten multiples1,734,002, 3,468,004, 5,202,006, 6,936,008, 8,670,010, 10,404,012, 12,138,014, 13,872,016, 15,606,018, 17,340,020
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 1189the total stopping time
Highest value reached2,926,1321× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,734,002 → 867,001 → 2,601,004 → 1,300,502 → 650,251 → 1,950,754 → 975,377 → 2,926,132 → 1,463,066 → 731,533 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage173,400,200%
1,734,002% as a decimal17,340.02
1,734,002% of 1001,734,002
1,734,002% of 1,00017,340,020
As a fraction of 1001,734,002/100

Read another way

As bytes1.654 MiB
As a 24-bit colour#1A7572

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1734002” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.