Nerdulator> put something in

Recognised as Number

4,445,661

  • Positive
  • Odd
  • Composite
  • 7 digits

4,445,661 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,445,661
Digit count7
Digit sum30
Digit product11,520
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11^2 × 37 × 331
Distinct prime factors43, 11, 37, 331
Number of divisors24
Sum of divisors σ(n)6,711,712
Aliquot sum2,266,051sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,613,600integers below n that share no factor with it
Carmichael function λ(n)1,980the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,613,600
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 11, 33, 37, 111, 121, 331, 363, 407, 993, 1,221, 3,641, 4,477, 10,923, 12,247, 13,431, 36,741, 40,051, 120,153, 134,717, 404,151, 1,481,887, 4,445,66124 in total

Arithmetic

Previous number4,445,660
Next number4,445,662
Double8,891,322
Cube87,863,607,115,205,339,781
Square root2,108.473618521≈irrational, shown to 9 decimal places
Cube root164.42913834≈
Negation-4,445,661
Reciprocal2.24938429 × 10^-7≈

Representations

Decimal4,445,661
Binary1000011110101011101110123 bits
Octal20752735
Hexadecimal43D5DD
Base 362NAAL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, four hundred and forty-five thousand, six hundred and sixty-one
Ordinalfour million, four hundred and forty-five thousand, six hundred and sixty-first
Scientific notation4.445661 × 10^6
Engineering notation4.445661 × 10^6

In other bases

Ternary22100212022010base 3; the most digit-efficient integer base after e: 14 digits
Quinary2114230121base 5; one hand: 10 digits
Septenary52534053base 7: 8 digits
Nonary8325263base 9; each digit is two ternary digits: 7 digits
Duodecimal15a4879base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal17fe31base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal20:34:54:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1010TT10T010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001000010101000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010000111101010111011101
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes343 d5 dd
Gray code11000100011111100110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010000111101010111011101
64-bit0000000000000000000000000000000000000000010000111101010111011101
One's complement11111111101111000010101000100010at 32 bits, every bit flipped
Bits reversed10111011101010111100001000000000at 32 bits
Rotated left by 100000000100001111010101110111010at 32 bits, wrapping
Shifted left by 1100001111010101110111010= 8,891,322, no wrap
Shifted right by 11000011110101011101110= 2,222,830, discarding the low bit
These bits as a double2.19644837 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,445,663+2
Previous prime4,445,659−2
Distance to nearest prime2
Nearest square below4,443,664
Nearest square above4,447,881

Powers & multiples

4,445,661 to the power 219,763,901,726,921
4,445,661 to the power 387,863,607,115,205,339,781
4,445,661 to the power 4390,611,811,471,390,886,056,140,241
4,445,661 to the power 51,736,527,696,397,715,077,895,226,479,944,301
First ten multiples4,445,661, 8,891,322, 13,336,983, 17,782,644, 22,228,305, 26,673,966, 31,119,627, 35,565,288, 40,010,949, 44,456,610
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1193the total stopping time
Highest value reached13,336,9843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,445,661 → 13,336,984 → 6,668,492 → 3,334,246 → 1,667,123 → 5,001,370 → 2,500,685 → 7,502,056 → 3,751,028 → 1,875,514 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage444,566,100%
4,445,661% as a decimal44,456.61
4,445,661% of 1004,445,661
4,445,661% of 1,00044,456,610
As a fraction of 1004,445,661/100

Read another way

As bytes4.24 MiB
As a 24-bit colour#43D5DD

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