Recognised as Number
4,009,493
- Positive
- Odd
- Composite
- 7 digits
4,009,493 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,009,493
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,663 × 2,411
Distinct prime factors21,663, 2,411
Number of divisors4
Sum of divisors σ(n)4,013,568
Aliquot sum4,075sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,005,420integers below n that share no factor with it
Carmichael function λ(n)2,002,710the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,005,420
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,663, 2,411, 4,009,4934 in total
Arithmetic
Previous number4,009,492
Next number4,009,494
Double8,018,986
Half2,004,746.5
Square16,076,034,117,049
Cube64,456,746,260,069,146,157
Square root2,002.371843589≈irrational, shown to 9 decimal places
Cube root158.865582638≈
Negation-4,009,493
Reciprocal2.49408092 × 10^-7≈
Representations
Decimal4,009,493
Binary111101001011100001010122 bits
Octal17227025
Hexadecimal3D2E15
Base 362DXQT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, nine thousand, four hundred and ninety-three
Ordinalfour million, nine thousand, four hundred and ninety-third
Scientific notation4.009493 × 10^6
Engineering notation4.009493 × 10^6
In other bases
Ternary21112200222202base 3; the most digit-efficient integer base after e: 14 digits
Quinary2011300433base 5; one hand: 10 digits
Septenary46036325base 7: 8 digits
Nonary7480882base 9; each digit is two ternary digits: 7 digits
Duodecimal1414385base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1513edbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:33:44:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTT0T01000T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011010111001000010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111010010111000010101
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
Bytes33d 2e 15
Gray code1000111011100100011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111010010111000010101
64-bit0000000000000000000000000000000000000000001111010010111000010101
One's complement11111111110000101101000111101010at 32 bits, every bit flipped
Bits reversed10101000011101001011110000000000at 32 bits
Rotated left by 100000000011110100101110000101010at 32 bits, wrapping
Shifted left by 111110100101110000101010= 8,018,986, no wrap
Shifted right by 1111101001011100001010= 2,004,746, discarding the low bit
These bits as a double1.98095275 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,009,493 to the power 216,076,034,117,049
4,009,493 to the power 364,456,746,260,069,146,157
4,009,493 to the power 4258,438,872,932,523,421,032,468,401
4,009,493 to the power 51,036,208,851,950,842,128,965,734,826,530,693
First ten multiples4,009,493, 8,018,986, 12,028,479, 16,037,972, 20,047,465, 24,056,958, 28,066,451, 32,075,944, 36,085,437, 40,094,930
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 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 1260the total stopping time
Highest value reached29,295,5927× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,009,493 → 12,028,480 → 6,014,240 → 3,007,120 → 1,503,560 → 751,780 → 375,890 → 187,945 → 563,836 → 281,918 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage400,949,300%
4,009,493% as a decimal40,094.93
4,009,493% of 1004,009,493
4,009,493% of 1,00040,094,930
As a fraction of 1004,009,493/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,009,493
Nerdulate something else
Nothing in mind? Surprise me · today’s page