Nerdulator> put something in

Recognised as Number

3,601,669

  • Positive
  • Odd
  • Prime
  • 7 digits

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

Arithmetic

Previous number3,601,668
Next number3,601,670
Double7,203,338
Cube46,720,920,808,707,901,309
Square root1,897.806365254≈irrational, shown to 9 decimal places
Cube root153.285567457≈
Negation-3,601,669
Reciprocal2.77649057 × 10^-7≈

Representations

Decimal3,601,669
Binary110110111101010000010122 bits
Octal15572405
Hexadecimal36F505
Base 362572D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and one thousand, six hundred and sixty-nine
Ordinalthree million, six hundred and one thousand, six hundred and sixty-ninth
Scientific notation3.601669 × 10^6
Engineering notation3.601669 × 10^6

In other bases

Ternary20202222120011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410223134base 5; one hand: 10 digits
Septenary42420331base 7: 8 digits
Nonary6688504base 9; each digit is two ternary digits: 7 digits
Duodecimal1258371base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12a439base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:40:27:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T10000TT0011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110011010100000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101101111010100000101
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes336 f5 05
Gray code1011011000111110000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101101111010100000101
64-bit0000000000000000000000000000000000000000001101101111010100000101
One's complement11111111110010010000101011111010at 32 bits, every bit flipped
Bits reversed10100000101011110110110000000000at 32 bits
Rotated left by 100000000011011011110101000001010at 32 bits, wrapping
Shifted left by 111011011110101000001010= 7,203,338, no wrap
Shifted right by 1110110111101010000010= 1,800,834, discarding the low bit
These bits as a double1.77946092 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,601,679+10
Previous prime3,601,627−42
Distance to nearest prime0, it is prime
Nearest square below3,598,609
Nearest square above3,602,404

Powers & multiples

3,601,669 to the power 212,972,019,585,561
3,601,669 to the power 346,720,920,808,707,901,309
3,601,669 to the power 4168,273,292,128,178,178,199,684,721
3,601,669 to the power 5606,064,699,786,003,370,898,280,269,399,349
First ten multiples3,601,669, 7,203,338, 10,805,007, 14,406,676, 18,008,345, 21,610,014, 25,211,683, 28,813,352, 32,415,021, 36,016,690
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 189the total stopping time
Highest value reached10,805,0083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,601,669 → 10,805,008 → 5,402,504 → 2,701,252 → 1,350,626 → 675,313 → 2,025,940 → 1,012,970 → 506,485 → 1,519,456 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage360,166,900%
3,601,669% as a decimal36,016.69
3,601,669% of 1003,601,669
3,601,669% of 1,00036,016,690
As a fraction of 1003,601,669/100

Read another way

As bytes3.435 MiB
As a 24-bit colour#36F505

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