Recognised as Number
3,615,165
- Positive
- Odd
- Composite
- 7 digits
3,615,165 is an odd 7-digit integer and a composite number. It has 32 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,615,165
Digit count7
Digit sum27
Digit product2,700
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 5 × 61 × 439
Distinct prime factors43, 5, 61, 439
Number of divisors32
Sum of divisors σ(n)6,547,200
Aliquot sum2,932,035sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,892,160integers below n that share no factor with it
Carmichael function λ(n)13,140the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,892,160
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 27, 45, 61, 135, 183, 305, 439, 549, 915, 1,317, 1,647, 2,195, 2,745, 3,951, 6,585, 8,235, 11,853, 19,755, 26,779, 59,265, 80,337, 133,895, 241,011, 401,685, 723,033, 1,205,055, 3,615,16532 in total
Arithmetic
Previous number3,615,164
Next number3,615,166
Double7,230,330
Half1,807,582.5
Square13,069,417,977,225
Cube47,248,102,441,634,617,125
Square root1,901.358724702≈irrational, shown to 9 decimal places
Cube root153.476790232≈
Negation-3,615,165
Reciprocal2.76612547 × 10^-7≈
Representations
Decimal3,615,165
Binary110111001010011011110122 bits
Octal15624675
Hexadecimal3729BD
Base 3625HH9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and fifteen thousand, one hundred and sixty-five
Ordinalthree million, six hundred and fifteen thousand, one hundred and sixty-fifth
Scientific notation3.615165 × 10^6
Engineering notation3.615165 × 10^6
In other bases
Ternary20210200002000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1411141130base 5; one hand: 10 digits
Septenary42504561base 7: 8 digits
Nonary6720060base 9; each digit is two ternary digits: 7 digits
Duodecimal1264139base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12bhi5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:44:12:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T11T0001T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110111111011001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110010100110111101
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
Bytes337 29 bd
Gray code1011001011110101100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110010100110111101
64-bit0000000000000000000000000000000000000000001101110010100110111101
One's complement11111111110010001101011001000010at 32 bits, every bit flipped
Bits reversed10111101100101001110110000000000at 32 bits
Rotated left by 100000000011011100101001101111010at 32 bits, wrapping
Shifted left by 111011100101001101111010= 7,230,330, no wrap
Shifted right by 1110111001010011011110= 1,807,582, discarding the low bit
These bits as a double1.78612883 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,615,165 to the power 213,069,417,977,225
3,615,165 to the power 347,248,102,441,634,617,125
3,615,165 to the power 4170,809,686,263,412,010,618,700,625
3,615,165 to the power 5617,505,199,440,467,881,368,354,844,978,125
First ten multiples3,615,165, 7,230,330, 10,845,495, 14,460,660, 18,075,825, 21,690,990, 25,306,155, 28,921,320, 32,536,485, 36,151,650
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 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 1203the total stopping time
Highest value reached55,654,50415× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,615,165 → 10,845,496 → 5,422,748 → 2,711,374 → 1,355,687 → 4,067,062 → 2,033,531 → 6,100,594 → 3,050,297 → 9,150,892 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage361,516,500%
3,615,165% as a decimal36,151.65
3,615,165% of 1003,615,165
3,615,165% of 1,00036,151,650
As a fraction of 1003,615,165/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,615,165
Nerdulate something else
Nothing in mind? Surprise me · today’s page