Recognised as Number
4,135,949
- Positive
- Odd
- Composite
- 7 digits
4,135,949 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,135,949
Digit count7
Digit sum35
Digit product19,440
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation419 × 9,871
Distinct prime factors2419, 9,871
Number of divisors4
Sum of divisors σ(n)4,146,240
Aliquot sum10,291sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,125,660integers below n that share no factor with it
Carmichael function λ(n)2,062,830the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,125,660
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 419, 9,871, 4,135,9494 in total
Arithmetic
Previous number4,135,948
Next number4,135,950
Double8,271,898
Half2,067,974.5
Square17,106,074,130,601
Cube70,749,850,194,385,075,349
Square root2,033.703272358≈irrational, shown to 9 decimal places
Cube root160.518487274≈
Negation-4,135,949
Reciprocal2.41782478 × 10^-7≈
Representations
Decimal4,135,949
Binary111111000111000000110122 bits
Octal17616015
Hexadecimal3F1C0D
Base 362GNBH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and thirty-five thousand, nine hundred and forty-nine
Ordinalfour million, one hundred and thirty-five thousand, nine hundred and forty-ninth
Scientific notation4.135949 × 10^6
Engineering notation4.135949 × 10^6
In other bases
Ternary21210010110022base 3; the most digit-efficient integer base after e: 14 digits
Quinary2024322244base 5; one hand: 10 digits
Septenary50104106base 7: 8 digits
Nonary7703408base 9; each digit is two ternary digits: 7 digits
Duodecimal14755a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal15gjh9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:8:52:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT1001011010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000110110110000011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111110001110000001101
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes33f 1c 0d
Gray code1000001001001000001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111110001110000001101
64-bit0000000000000000000000000000000000000000001111110001110000001101
One's complement11111111110000001110001111110010at 32 bits, every bit flipped
Bits reversed10110000001110001111110000000000at 32 bits
Rotated left by 100000000011111100011100000011010at 32 bits, wrapping
Shifted left by 111111100011100000011010= 8,271,898, no wrap
Shifted right by 1111111000111000000110= 2,067,974, discarding the low bit
These bits as a double2.04343031 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,135,949 to the power 217,106,074,130,601
4,135,949 to the power 370,749,850,194,385,075,349
4,135,949 to the power 4292,617,772,161,616,758,004,621,201
4,135,949 to the power 51,210,252,182,154,066,668,652,455,051,654,749
First ten multiples4,135,949, 8,271,898, 12,407,847, 16,543,796, 20,679,745, 24,815,694, 28,951,643, 33,087,592, 37,223,541, 41,359,490
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1198the total stopping time
Highest value reached12,407,8483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,135,949 → 12,407,848 → 6,203,924 → 3,101,962 → 1,550,981 → 4,652,944 → 2,326,472 → 1,163,236 → 581,618 → 290,809 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage413,594,900%
4,135,949% as a decimal41,359.49
4,135,949% of 1004,135,949
4,135,949% of 1,00041,359,490
As a fraction of 1004,135,949/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,949
Nerdulate something else
Nothing in mind? Surprise me · today’s page