Recognised as Number
1,023,189
- Positive
- Odd
- Composite
- 7 digits
1,023,189 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,023,189
Digit count7
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 341,063
Distinct prime factors23, 341,063
Number of divisors4
Sum of divisors σ(n)1,364,256
Aliquot sum341,067sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)682,124integers below n that share no factor with it
Carmichael function λ(n)341,062the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 682,124
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 341,063, 1,023,1894 in total
Arithmetic
Previous number1,023,188
Next number1,023,190
Double2,046,378
Half511,594.5
Square1,046,915,729,721
Cube1,071,192,658,577,500,269
Square root1,011.528052008≈irrational, shown to 9 decimal places
Cube root100.767067694≈
Negation-1,023,189
Reciprocal9.77336543 × 10^-7≈
Representations
Decimal1,023,189
Binary1111100111001101010120 bits
Octal3716325
HexadecimalF9CD5
Base 36LXHX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, twenty-three thousand, one hundred and eighty-nine
Ordinalone million, twenty-three thousand, one hundred and eighty-ninth
Scientific notation1.023189 × 10^6
Engineering notation1.023189 × 10^6
In other bases
Ternary1220222112220base 3; the most digit-efficient integer base after e: 13 digits
Quinary230220224base 5; one hand: 9 digits
Septenary11461026base 7: 8 digits
Nonary1828486base 9; each digit is two ternary digits: 7 digits
Duodecimal414159base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal67hj9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:44:13:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T1000TT00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001110110111010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111001110011010101
Bit length20 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits7within that length
Bit parityodd13 set bits, so odd; 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 9c d5
Gray code10000101001010111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111001110011010101
64-bit0000000000000000000000000000000000000000000011111001110011010101
One's complement11111111111100000110001100101010at 32 bits, every bit flipped
Bits reversed10101011001110011111000000000000at 32 bits
Rotated left by 100000000000111110011100110101010at 32 bits, wrapping
Shifted left by 1111110011100110101010= 2,046,378, no wrap
Shifted right by 11111100111001101010= 511,594, discarding the low bit
These bits as a double5.05522534 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,023,189 to the power 21,046,915,729,721
1,023,189 to the power 31,071,192,658,577,500,269
1,023,189 to the power 41,096,032,545,137,253,922,737,841
1,023,189 to the power 51,121,448,443,826,441,703,952,208,794,949
First ten multiples1,023,189, 2,046,378, 3,069,567, 4,092,756, 5,115,945, 6,139,134, 7,162,323, 8,185,512, 9,208,701, 10,231,890
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 190the total stopping time
Highest value reached3,069,5683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,023,189 → 3,069,568 → 1,534,784 → 767,392 → 383,696 → 191,848 → 95,924 → 47,962 → 23,981 → 71,944 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage102,318,900%
1,023,189% as a decimal10,231.89
1,023,189% of 1001,023,189
1,023,189% of 1,00010,231,890
As a fraction of 1001,023,189/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,023,189
Nerdulate something else
Nothing in mind? Surprise me · today’s page