Nerdulator> put something in

Recognised as Number

3,955,509

  • Positive
  • Odd
  • Composite
  • 7 digits

3,955,509 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,955,509
Digit count7
Digit sum36
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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 17 × 103 × 251
Distinct prime factors43, 17, 103, 251
Number of divisors24
Sum of divisors σ(n)6,132,672
Aliquot sum2,177,163sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,448,000integers below n that share no factor with it
Carmichael function λ(n)102,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,448,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 17, 51, 103, 153, 251, 309, 753, 927, 1,751, 2,259, 4,267, 5,253, 12,801, 15,759, 25,853, 38,403, 77,559, 232,677, 439,501, 1,318,503, 3,955,50924 in total

Arithmetic

Previous number3,955,508
Next number3,955,510
Double7,911,018
Cube61,888,097,321,302,937,229
Square root1,988.846147896≈irrational, shown to 9 decimal places
Cube root158.149367375≈
Negation-3,955,509
Reciprocal2.52811964 × 10^-7≈

Representations

Decimal3,955,509
Binary111100010110110011010122 bits
Octal17055465
Hexadecimal3C5B35
Base 362CS39
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, nine hundred and fifty-five thousand, five hundred and nine
Ordinalthree million, nine hundred and fifty-five thousand, five hundred and ninth
Scientific notation3.955509 × 10^6
Engineering notation3.955509 × 10^6

In other bases

Ternary21102221221100base 3; the most digit-efficient integer base after e: 14 digits
Quinary2003034014base 5; one hand: 10 digits
Septenary45423045base 7: 8 digits
Nonary7387840base 9; each digit is two ternary digits: 7 digits
Duodecimal13a9099base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal14e8f9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:18:45:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T111000T0T1100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011010111101110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001111000101101100110101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 set bits, so odd; 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
Bytes33c 5b 35
Gray code1000100111011010101111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001111000101101100110101
64-bit0000000000000000000000000000000000000000001111000101101100110101
One's complement11111111110000111010010011001010at 32 bits, every bit flipped
Bits reversed10101100110110100011110000000000at 32 bits
Rotated left by 100000000011110001011011001101010at 32 bits, wrapping
Shifted left by 111110001011011001101010= 7,911,018, no wrap
Shifted right by 1111100010110110011010= 1,977,754, discarding the low bit
These bits as a double1.95428111 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,955,529+20
Previous prime3,955,499−10
Distance to nearest prime10
Nearest square below3,952,144
Nearest square above3,956,121

Powers & multiples

3,955,509 to the power 215,646,051,449,081
3,955,509 to the power 361,888,097,321,302,937,229
3,955,509 to the power 4244,798,925,947,289,659,935,744,561
3,955,509 to the power 5968,304,354,774,837,775,482,777,032,736,549
First ten multiples3,955,509, 7,911,018, 11,866,527, 15,822,036, 19,777,545, 23,733,054, 27,688,563, 31,644,072, 35,599,581, 39,555,090
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 166the total stopping time
Highest value reached11,866,5283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,955,509 → 11,866,528 → 5,933,264 → 2,966,632 → 1,483,316 → 741,658 → 370,829 → 1,112,488 → 556,244 → 278,122 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage395,550,900%
3,955,509% as a decimal39,555.09
3,955,509% of 1003,955,509
3,955,509% of 1,00039,555,090
As a fraction of 1003,955,509/100

Read another way

As bytes3.772 MiB
As a 24-bit colour#3C5B35

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