Recognised as Number
1,024,043
- Positive
- Odd
- Composite
- 7 digits
1,024,043 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 value1,024,043
Digit count7
Digit sum14
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation19 × 53,897
Distinct prime factors219, 53,897
Number of divisors4
Sum of divisors σ(n)1,077,960
Aliquot sum53,917sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)970,128integers below n that share no factor with it
Carmichael function λ(n)485,064the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 970,128
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 53,897, 1,024,0434 in total
Arithmetic
Previous number1,024,042
Next number1,024,044
Double2,048,086
Half512,021.5
Square1,048,664,065,849
Cube1,073,877,095,984,207,507
Square root1,011.950097584≈irrational, shown to 9 decimal places
Cube root100.795094821≈
Negation-1,024,043
Reciprocal9.76521494 × 10^-7≈
Representations
Decimal1,024,043
Binary1111101000000010101120 bits
Octal3720053
HexadecimalFA02B
Base 36LY5N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, twenty-four thousand and forty-three
Ordinalone million, twenty-four thousand and forty-third
Scientific notation1.024043 × 10^6
Engineering notation1.024043 × 10^6
In other bases
Ternary1221000201112base 3; the most digit-efficient integer base after e: 13 digits
Quinary230232133base 5; one hand: 9 digits
Septenary11463356base 7: 8 digits
Nonary1830645base 9; each digit is two ternary digits: 7 digits
Duodecimal41474bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal68023base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:44:27:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T1001T1TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001110000001111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111010000000101011
Bit length20 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits10within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 19worth 524,288
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes30f a0 2b
Gray code10000111000000111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111010000000101011
64-bit0000000000000000000000000000000000000000000011111010000000101011
One's complement11111111111100000101111111010100at 32 bits, every bit flipped
Bits reversed11010100000001011111000000000000at 32 bits
Rotated left by 100000000000111110100000001010110at 32 bits, wrapping
Shifted left by 1111110100000001010110= 2,048,086, no wrap
Shifted right by 11111101000000010101= 512,021, discarding the low bit
These bits as a double5.05944466 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,024,043 to the power 21,048,664,065,849
1,024,043 to the power 31,073,877,095,984,207,507
1,024,043 to the power 41,099,696,323,002,955,808,090,801
1,024,043 to the power 51,126,136,321,696,915,874,584,728,128,443
First ten multiples1,024,043, 2,048,086, 3,072,129, 4,096,172, 5,120,215, 6,144,258, 7,168,301, 8,192,344, 9,216,387, 10,240,430
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1258the total stopping time
Highest value reached4,608,1964× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,024,043 → 3,072,130 → 1,536,065 → 4,608,196 → 2,304,098 → 1,152,049 → 3,456,148 → 1,728,074 → 864,037 → 2,592,112 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage102,404,300%
1,024,043% as a decimal10,240.43
1,024,043% of 1001,024,043
1,024,043% of 1,00010,240,430
As a fraction of 1001,024,043/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 1,024,043
Nerdulate something else
Nothing in mind? Surprise me · today’s page