Recognised as Number
3,815,555
- Positive
- Odd
- Composite
- 7 digits
3,815,555 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,815,555
Digit count7
Digit sum32
Digit product15,000
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 763,111
Distinct prime factors25, 763,111
Number of divisors4
Sum of divisors σ(n)4,578,672
Aliquot sum763,117sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,052,440integers below n that share no factor with it
Carmichael function λ(n)1,526,220the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,052,440
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 763,111, 3,815,5554 in total
Arithmetic
Previous number3,815,554
Next number3,815,556
Double7,631,110
Half1,907,777.5
Square14,558,459,958,025
Cube55,548,604,685,142,078,875
Square root1,953.344567658≈irrational, shown to 9 decimal places
Cube root156.261710056≈
Negation-3,815,555
Reciprocal2.6208507 × 10^-7≈
Representations
Decimal3,815,555
Binary111010001110001000001122 bits
Octal16434203
Hexadecimal3A3883
Base 3629S3N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and fifteen thousand, five hundred and fifty-five
Ordinalthree million, eight hundred and fifteen thousand, five hundred and fifty-fifth
Scientific notation3.815555 × 10^6
Engineering notation3.815555 × 10^6
In other bases
Ternary21011211221212base 3; the most digit-efficient integer base after e: 14 digits
Quinary1434044210base 5; one hand: 10 digits
Septenary44301032base 7: 8 digits
Nonary7154855base 9; each digit is two ternary digits: 7 digits
Duodecimal13400abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal13gihfbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal17:39:52:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11TT0TT00T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011100100100110000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110100011100010000011
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes33a 38 83
Gray code1001110010010011000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110100011100010000011
64-bit0000000000000000000000000000000000000000001110100011100010000011
One's complement11111111110001011100011101111100at 32 bits, every bit flipped
Bits reversed11000001000111000101110000000000at 32 bits
Rotated left by 100000000011101000111000100000110at 32 bits, wrapping
Shifted left by 111101000111000100000110= 7,631,110, no wrap
Shifted right by 1111010001110001000001= 1,907,777, discarding the low bit
These bits as a double1.88513465 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,815,555 to the power 214,558,459,958,025
3,815,555 to the power 355,548,604,685,142,078,875
3,815,555 to the power 4211,948,756,349,417,284,761,900,625
3,815,555 to the power 5808,702,137,032,800,867,959,693,739,221,875
First ten multiples3,815,555, 7,631,110, 11,446,665, 15,262,220, 19,077,775, 22,893,330, 26,708,885, 30,524,440, 34,339,995, 38,155,550
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 2
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1128the total stopping time
Highest value reached17,170,0004× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,815,555 → 11,446,666 → 5,723,333 → 17,170,000 → 8,585,000 → 4,292,500 → 2,146,250 → 1,073,125 → 3,219,376 → 1,609,688 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage381,555,500%
3,815,555% as a decimal38,155.55
3,815,555% of 1003,815,555
3,815,555% of 1,00038,155,550
As a fraction of 1003,815,555/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 3,815,555
Nerdulate something else
Nothing in mind? Surprise me · today’s page