Recognised as Number
4,089,135
- Positive
- Odd
- Composite
- 7 digits
4,089,135 is an odd 7-digit integer and a composite number. It has 32 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,089,135
Digit count7
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 5 × 41 × 61 × 109
Distinct prime factors53, 5, 41, 61, 109
Number of divisors32
Sum of divisors σ(n)6,874,560
Aliquot sum2,785,425sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,073,600integers below n that share no factor with it
Carmichael function λ(n)1,080the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,073,600
Möbius function μ(n)−15 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 41, 61, 109, 123, 183, 205, 305, 327, 545, 615, 915, 1,635, 2,501, 4,469, 6,649, 7,503, 12,505, 13,407, 19,947, 22,345, 33,245, 37,515, 67,035, 99,735, 272,609, 817,827, 1,363,045, 4,089,13532 in total
Arithmetic
Previous number4,089,134
Next number4,089,136
Double8,178,270
Half2,044,567.5
Square16,721,025,048,225
Cube68,374,528,760,573,535,375
Square root2,022.160972821≈irrational, shown to 9 decimal places
Cube root159.910561994≈
Negation-4,089,135
Reciprocal2.44550498 × 10^-7≈
Representations
Decimal4,089,135
Binary111110011001010010111122 bits
Octal17462457
Hexadecimal3E652F
Base 362FN73
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, eighty-nine thousand, one hundred and thirty-five
Ordinalfour million, eighty-nine thousand, one hundred and thirty-fifth
Scientific notation4.089135 × 10^6
Engineering notation4.089135 × 10^6
In other bases
Ternary21200202020110base 3; the most digit-efficient integer base after e: 14 digits
Quinary2021323020base 5; one hand: 10 digits
Septenary46520451base 7: 8 digits
Nonary7622213base 9; each digit is two ternary digits: 7 digits
Duodecimal1452493base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal15b2gfbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:55:52:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT01T1T1T0110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000111010010101110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111100110010100101111
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
Bytes33e 65 2f
Gray code1000010101011110111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111100110010100101111
64-bit0000000000000000000000000000000000000000001111100110010100101111
One's complement11111111110000011001101011010000at 32 bits, every bit flipped
Bits reversed11110100101001100111110000000000at 32 bits
Rotated left by 100000000011111001100101001011110at 32 bits, wrapping
Shifted left by 111111001100101001011110= 8,178,270, no wrap
Shifted right by 1111110011001010010111= 2,044,567, discarding the low bit
These bits as a double2.02030112 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,089,135 to the power 216,721,025,048,225
4,089,135 to the power 368,374,528,760,573,535,375
4,089,135 to the power 4279,592,678,663,367,863,575,650,625
4,089,135 to the power 51,143,292,208,066,130,748,822,418,118,459,375
First ten multiples4,089,135, 8,178,270, 12,267,405, 16,356,540, 20,445,675, 24,534,810, 28,623,945, 32,713,080, 36,802,215, 40,891,350
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 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 35
Collatz (3n + 1) trajectory
Steps to reach 1335the total stopping time
Highest value reached62,951,09215× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,089,135 → 12,267,406 → 6,133,703 → 18,401,110 → 9,200,555 → 27,601,666 → 13,800,833 → 41,402,500 → 20,701,250 → 10,350,625 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage408,913,500%
4,089,135% as a decimal40,891.35
4,089,135% of 1004,089,135
4,089,135% of 1,00040,891,350
As a fraction of 1004,089,135/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 4,089,135
Nerdulate something else
Nothing in mind? Surprise me · today’s page