Nerdulator> put something in

Recognised as Number

3,402,673

  • Positive
  • Odd
  • Prime
  • 7 digits

3,402,673 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,402,673
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3,402,673
Distinct prime factors13,402,673
Number of divisors2
Sum of divisors σ(n)3,402,674
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,402,672integers below n that share no factor with it
Carmichael function λ(n)3,402,672the 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, 3,402,6732 in total

Arithmetic

Previous number3,402,672
Next number3,402,674
Double6,805,346
Cube39,396,772,537,374,195,217
Square root1,844.633567948≈irrational, shown to 9 decimal places
Cube root150.408854942≈
Negation-3,402,673
Reciprocal2.938866 × 10^-7≈

Representations

Decimal3,402,673
Binary110011111010111011000122 bits
Octal14765661
Hexadecimal33EBB1
Base 3620XIP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and two thousand, six hundred and seventy-three
Ordinalthree million, four hundred and two thousand, six hundred and seventy-third
Scientific notation3.402673 × 10^6
Engineering notation3.402673 × 10^6

In other bases

Ternary20101212120221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1332341143base 5; one hand: 10 digits
Septenary40631221base 7: 8 digits
Nonary6355527base 9; each digit is two ternary digits: 7 digits
Duodecimal1181181base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1156ddbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:45:11:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T011T0T0TT10T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000011110011110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001100111110101110110001
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes333 eb b1
Gray code1010100001111001101001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001100111110101110110001
64-bit0000000000000000000000000000000000000000001100111110101110110001
One's complement11111111110011000001010001001110at 32 bits, every bit flipped
Bits reversed10001101110101111100110000000000at 32 bits
Rotated left by 100000000011001111101011101100010at 32 bits, wrapping
Shifted left by 111001111101011101100010= 6,805,346, no wrap
Shifted right by 1110011111010111011000= 1,701,336, discarding the low bit
These bits as a double1.68114383 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,402,677+4
Previous prime3,402,671−2
Distance to nearest prime0, it is prime
Nearest square below3,400,336
Nearest square above3,404,025

Powers & multiples

3,402,673 to the power 211,578,183,544,929
3,402,673 to the power 339,396,772,537,374,195,217
3,402,673 to the power 4134,054,334,200,064,664,961,615,041
3,402,673 to the power 5456,143,063,515,536,633,718,933,536,404,593
First ten multiples3,402,673, 6,805,346, 10,208,019, 13,610,692, 17,013,365, 20,416,038, 23,818,711, 27,221,384, 30,624,057, 34,026,730
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 184the total stopping time
Highest value reached10,208,0203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,402,673 → 10,208,020 → 5,104,010 → 2,552,005 → 7,656,016 → 3,828,008 → 1,914,004 → 957,002 → 478,501 → 1,435,504 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage340,267,300%
3,402,673% as a decimal34,026.73
3,402,673% of 1003,402,673
3,402,673% of 1,00034,026,730
As a fraction of 1003,402,673/100

Read another way

As bytes3.245 MiB
As a 24-bit colour#33EBB1

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 “3402673” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.