Recognised as Number
4,029,041
- Positive
- Odd
- Composite
- 7 digits
4,029,041 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,029,041
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation37 × 108,893
Distinct prime factors237, 108,893
Number of divisors4
Sum of divisors σ(n)4,137,972
Aliquot sum108,931sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,920,112integers below n that share no factor with it
Carmichael function λ(n)980,028the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,920,112
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 37, 108,893, 4,029,0414 in total
Arithmetic
Previous number4,029,040
Next number4,029,042
Double8,058,082
Half2,014,520.5
Square16,233,171,379,681
Cube65,404,113,048,761,315,921
Square root2,007.247119814≈irrational, shown to 9 decimal places
Cube root159.123343502≈
Negation-4,029,041
Reciprocal2.4819802 × 10^-7≈
Representations
Decimal4,029,041
Binary111101011110100111000122 bits
Octal17275161
Hexadecimal3D7A71
Base 362ECTT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, twenty-nine thousand and forty-one
Ordinalfour million, twenty-nine thousand and forty-first
Scientific notation4.029041 × 10^6
Engineering notation4.029041 × 10^6
In other bases
Ternary21120200210202base 3; the most digit-efficient integer base after e: 14 digits
Quinary2012412131base 5; one hand: 10 digits
Septenary46150322base 7: 8 digits
Nonary7520722base 9; each digit is two ternary digits: 7 digits
Duodecimal1423755base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal153cc1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:39:10:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT1T01T11T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000101000111110110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111010111101001110001
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
Bytes33d 7a 71
Gray code1000111100011101001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111010111101001110001
64-bit0000000000000000000000000000000000000000001111010111101001110001
One's complement11111111110000101000010110001110at 32 bits, every bit flipped
Bits reversed10001110010111101011110000000000at 32 bits
Rotated left by 100000000011110101111010011100010at 32 bits, wrapping
Shifted left by 111110101111010011100010= 8,058,082, no wrap
Shifted right by 1111101011110100111000= 2,014,520, discarding the low bit
These bits as a double1.99061074 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,029,041 to the power 216,233,171,379,681
4,029,041 to the power 365,404,113,048,761,315,921
4,029,041 to the power 4263,515,853,042,094,341,059,661,761
4,029,041 to the power 51,061,716,176,056,572,825,997,360,681,201,201
First ten multiples4,029,041, 8,058,082, 12,087,123, 16,116,164, 20,145,205, 24,174,246, 28,203,287, 32,232,328, 36,261,369, 40,290,410
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached12,087,1243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,029,041 → 12,087,124 → 6,043,562 → 3,021,781 → 9,065,344 → 4,532,672 → 2,266,336 → 1,133,168 → 566,584 → 283,292 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage402,904,100%
4,029,041% as a decimal40,290.41
4,029,041% of 1004,029,041
4,029,041% of 1,00040,290,410
As a fraction of 1004,029,041/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,029,041
Nerdulate something else
Nothing in mind? Surprise me · today’s page