Recognised as Number
4,037,513
- Positive
- Odd
- Composite
- 7 digits
4,037,513 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,037,513
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation691 × 5,843
Distinct prime factors2691, 5,843
Number of divisors4
Sum of divisors σ(n)4,044,048
Aliquot sum6,535sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,030,980integers below n that share no factor with it
Carmichael function λ(n)87,630the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,030,980
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 691, 5,843, 4,037,5134 in total
Arithmetic
Previous number4,037,512
Next number4,037,514
Double8,075,026
Half2,018,756.5
Square16,301,511,225,169
Cube65,817,563,491,265,764,697
Square root2,009.35636461≈irrational, shown to 9 decimal places
Cube root159.234796755≈
Negation-4,037,513
Reciprocal2.47677221 × 10^-7≈
Representations
Decimal4,037,513
Binary111101100110111000100122 bits
Octal17315611
Hexadecimal3D9B89
Base 362EJD5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, thirty-seven thousand, five hundred and thirteen
Ordinalfour million, thirty-seven thousand, five hundred and thirteenth
Scientific notation4.037513 × 10^6
Engineering notation4.037513 × 10^6
In other bases
Ternary21121010102112base 3; the most digit-efficient integer base after e: 14 digits
Quinary2013200023base 5; one hand: 10 digits
Septenary46214114base 7: 8 digits
Nonary7533375base 9; each digit is two ternary digits: 7 digits
Duodecimal1428635base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal154dfdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:41:31:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT1010110TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000101110110010011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111011001101110001001
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
Bytes33d 9b 89
Gray code1000110101011001001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111011001101110001001
64-bit0000000000000000000000000000000000000000001111011001101110001001
One's complement11111111110000100110010001110110at 32 bits, every bit flipped
Bits reversed10010001110110011011110000000000at 32 bits
Rotated left by 100000000011110110011011100010010at 32 bits, wrapping
Shifted left by 111110110011011100010010= 8,075,026, no wrap
Shifted right by 1111101100110111000100= 2,018,756, discarding the low bit
These bits as a double1.99479647 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,037,513 to the power 216,301,511,225,169
4,037,513 to the power 365,817,563,491,265,764,697
4,037,513 to the power 4265,739,268,224,310,911,419,078,561
4,037,513 to the power 51,072,925,750,066,142,220,896,378,138,058,793
First ten multiples4,037,513, 8,075,026, 12,112,539, 16,150,052, 20,187,565, 24,225,078, 28,262,591, 32,300,104, 36,337,617, 40,375,130
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1141the total stopping time
Highest value reached38,803,9129× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,037,513 → 12,112,540 → 6,056,270 → 3,028,135 → 9,084,406 → 4,542,203 → 13,626,610 → 6,813,305 → 20,439,916 → 10,219,958 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage403,751,300%
4,037,513% as a decimal40,375.13
4,037,513% of 1004,037,513
4,037,513% of 1,00040,375,130
As a fraction of 1004,037,513/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,037,513
Nerdulate something else
Nothing in mind? Surprise me · today’s page