Recognised as Number
4,015,388
- Positive
- Even
- Composite
- 7 digits
4,015,388 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,015,388
Digit count7
Digit sum29
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 factorisation2^2 × 13 × 37 × 2,087
Distinct prime factors42, 13, 37, 2,087
Number of divisors24
Sum of divisors σ(n)7,775,712
Aliquot sum3,760,324sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,802,304integers below n that share no factor with it
Carmichael function λ(n)37,548the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,802,304
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 13, 26, 37, 52, 74, 148, 481, 962, 1,924, 2,087, 4,174, 8,348, 27,131, 54,262, 77,219, 108,524, 154,438, 308,876, 1,003,847, 2,007,694, 4,015,38824 in total
Arithmetic
Previous number4,015,387
Next number4,015,389
Double8,030,776
Half2,007,694
Square16,123,340,790,544
Cube64,741,469,130,260,891,072
Square root2,003.843307247≈irrational, shown to 9 decimal places
Cube root158.943402453≈
Negation-4,015,388
Reciprocal2.49041936 × 10^-7≈
Representations
Decimal4,015,388
Binary111101010001010001110022 bits
Octal17242434
Hexadecimal3D451C
Base 362E2AK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, fifteen thousand, three hundred and eighty-eight
Ordinalfour million, fifteen thousand, three hundred and eighty-eighth
Scientific notation4.015388 × 10^6
Engineering notation4.015388 × 10^6
In other bases
Ternary21120000002002base 3; the most digit-efficient integer base after e: 14 digits
Quinary2011443023base 5; one hand: 10 digits
Septenary46062446base 7: 8 digits
Nonary7500062base 9; each digit is two ternary digits: 7 digits
Duodecimal1417878base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal151i98base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:35:23:8base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT000001T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011010100010101101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111010100010100011100
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes33d 45 1c
Gray code1000111110011110010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111010100010100011100
64-bit0000000000000000000000000000000000000000001111010100010100011100
One's complement11111111110000101011101011100011at 32 bits, every bit flipped
Bits reversed00111000101000101011110000000000at 32 bits
Rotated left by 100000000011110101000101000111000at 32 bits, wrapping
Shifted left by 111110101000101000111000= 8,030,776, no wrap
Shifted right by 1111101010001010001110= 2,007,694, discarding the low bit
These bits as a double1.98386527 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,015,388 to the power 216,123,340,790,544
4,015,388 to the power 364,741,469,130,260,891,072
4,015,388 to the power 4259,962,118,248,020,018,879,815,936
4,015,388 to the power 51,043,848,770,067,680,607,569,786,351,623,168
First ten multiples4,015,388, 8,030,776, 12,046,164, 16,061,552, 20,076,940, 24,092,328, 28,107,716, 32,123,104, 36,138,492, 40,153,880
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 8
Divisible by 100No, remainder 88
Collatz (3n + 1) trajectory
Steps to reach 1198the total stopping time
Highest value reached19,295,6564× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,015,388 → 2,007,694 → 1,003,847 → 3,011,542 → 1,505,771 → 4,517,314 → 2,258,657 → 6,775,972 → 3,387,986 → 1,693,993 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage401,538,800%
4,015,388% as a decimal40,153.88
4,015,388% of 1004,015,388
4,015,388% of 1,00040,153,880
As a fraction of 1004,015,388/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,015,388
Nerdulate something else
Nothing in mind? Surprise me · today’s page