Recognised as Number
4,095,601
- Positive
- Odd
- Composite
- 7 digits
4,095,601 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,095,601
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation61 × 67,141
Distinct prime factors261, 67,141
Number of divisors4
Sum of divisors σ(n)4,162,804
Aliquot sum67,203sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,028,400integers below n that share no factor with it
Carmichael function λ(n)67,140the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,028,400
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 61, 67,141, 4,095,6014 in total
Arithmetic
Previous number4,095,600
Next number4,095,602
Double8,191,202
Half2,047,800.5
Square16,773,947,551,201
Cube68,699,396,364,646,366,801
Square root2,023.759125983≈irrational, shown to 9 decimal places
Cube root159.994804519≈
Negation-4,095,601
Reciprocal2.4416441 × 10^-7≈
Representations
Decimal4,095,601
Binary111110011111100111000122 bits
Octal17477161
Hexadecimal3E7E71
Base 362FS6P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, ninety-five thousand, six hundred and one
Ordinalfour million, ninety-five thousand, six hundred and first
Scientific notation4.095601 × 10^6
Engineering notation4.095601 × 10^6
In other bases
Ternary21201002002221base 3; the most digit-efficient integer base after e: 14 digits
Quinary2022024401base 5; one hand: 10 digits
Septenary46545346base 7: 8 digits
Nonary7632087base 9; each digit is two ternary digits: 7 digits
Duodecimal1456181base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal15bj01base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:57:40:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT0101T0100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000111000001110110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111100111111001110001
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 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
Bytes33e 7e 71
Gray code1000010100000101001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111100111111001110001
64-bit0000000000000000000000000000000000000000001111100111111001110001
One's complement11111111110000011000000110001110at 32 bits, every bit flipped
Bits reversed10001110011111100111110000000000at 32 bits
Rotated left by 100000000011111001111110011100010at 32 bits, wrapping
Shifted left by 111111001111110011100010= 8,191,202, no wrap
Shifted right by 1111110011111100111000= 2,047,800, discarding the low bit
These bits as a double2.02349575 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,095,601 to the power 216,773,947,551,201
4,095,601 to the power 368,699,396,364,646,366,801
4,095,601 to the power 4281,365,316,450,442,024,516,542,401
4,095,601 to the power 51,152,360,071,419,746,806,051,975,574,078,001
First ten multiples4,095,601, 8,191,202, 12,286,803, 16,382,404, 20,478,005, 24,573,606, 28,669,207, 32,764,808, 36,860,409, 40,956,010
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1260the total stopping time
Highest value reached12,286,8043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,095,601 → 12,286,804 → 6,143,402 → 3,071,701 → 9,215,104 → 4,607,552 → 2,303,776 → 1,151,888 → 575,944 → 287,972 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage409,560,100%
4,095,601% as a decimal40,956.01
4,095,601% of 1004,095,601
4,095,601% of 1,00040,956,010
As a fraction of 1004,095,601/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,095,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page