Recognised as Number
4,135,987
- Positive
- Odd
- Prime
- 7 digits
4,135,987 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,135,987
Digit count7
Digit sum37
Digit product30,240
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,135,987
Distinct prime factors14,135,987
Number of divisors2
Sum of divisors σ(n)4,135,988
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,135,986integers below n that share no factor with it
Carmichael function λ(n)4,135,986the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,135,9872 in total
Arithmetic
Previous number4,135,986
Next number4,135,988
Double8,271,974
Half2,067,993.5
Square17,106,388,464,169
Cube70,751,800,304,752,949,803
Square root2,033.712614899≈irrational, shown to 9 decimal places
Cube root160.518978873≈
Negation-4,135,987
Reciprocal2.41780257 × 10^-7≈
Representations
Decimal4,135,987
Binary111111000111000011001122 bits
Octal17616063
Hexadecimal3F1C33
Base 362GNCJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and thirty-five thousand, nine hundred and eighty-seven
Ordinalfour million, one hundred and thirty-five thousand, nine hundred and eighty-seventh
Scientific notation4.135987 × 10^6
Engineering notation4.135987 × 10^6
In other bases
Ternary21210010111201base 3; the most digit-efficient integer base after e: 14 digits
Quinary2024322422base 5; one hand: 10 digits
Septenary50104162base 7: 8 digits
Nonary7703451base 9; each digit is two ternary digits: 7 digits
Duodecimal1475617base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal15gjj7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:8:53:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT10011TTTT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000110110110001110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111110001110000110011
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
Bytes33f 1c 33
Gray code1000001001001000101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111110001110000110011
64-bit0000000000000000000000000000000000000000001111110001110000110011
One's complement11111111110000001110001111001100at 32 bits, every bit flipped
Bits reversed11001100001110001111110000000000at 32 bits
Rotated left by 100000000011111100011100001100110at 32 bits, wrapping
Shifted left by 111111100011100001100110= 8,271,974, no wrap
Shifted right by 1111111000111000011001= 2,067,993, discarding the low bit
These bits as a double2.04344909 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,135,987 to the power 217,106,388,464,169
4,135,987 to the power 370,751,800,304,752,949,803
4,135,987 to the power 4292,628,526,287,054,238,596,860,561
4,135,987 to the power 51,210,307,780,552,414,599,131,513,521,108,707
First ten multiples4,135,987, 8,271,974, 12,407,961, 16,543,948, 20,679,935, 24,815,922, 28,951,909, 33,087,896, 37,223,883, 41,359,870
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1105the total stopping time
Highest value reached18,611,9444× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,135,987 → 12,407,962 → 6,203,981 → 18,611,944 → 9,305,972 → 4,652,986 → 2,326,493 → 6,979,480 → 3,489,740 → 1,744,870 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage413,598,700%
4,135,987% as a decimal41,359.87
4,135,987% of 1004,135,987
4,135,987% of 1,00041,359,870
As a fraction of 1004,135,987/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,135,987
Nerdulate something else
Nothing in mind? Surprise me · today’s page