Recognised as Number
1,389,311
- Positive
- Odd
- Composite
- 7 digits
1,389,311 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,389,311
Digit count7
Digit sum26
Digit product648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 11 × 18,043
Distinct prime factors37, 11, 18,043
Number of divisors8
Sum of divisors σ(n)1,732,224
Aliquot sum342,913sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,082,520integers below n that share no factor with it
Carmichael function λ(n)90,210the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,082,520
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 11, 77, 18,043, 126,301, 198,473, 1,389,3118 in total
Arithmetic
Previous number1,389,310
Next number1,389,312
Double2,778,622
Half694,655.5
Square1,930,185,054,721
Cube2,681,627,328,559,487,231
Square root1,178.69037495≈irrational, shown to 9 decimal places
Cube root111.583460206≈
Negation-1,389,311
Reciprocal7.19781244 × 10^-7≈
Representations
Decimal1,389,311
Binary10101001100101111111121 bits
Octal5231377
Hexadecimal1532FF
Base 36TRZZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and eighty-nine thousand, three hundred and eleven
Ordinalone million, three hundred and eighty-nine thousand, three hundred and eleventh
Scientific notation1.389311 × 10^6
Engineering notation1.389311 × 10^6
In other bases
Ternary2121120202222base 3; the most digit-efficient integer base after e: 13 digits
Quinary323424221base 5; one hand: 9 digits
Septenary14544320base 7: 8 digits
Nonary2546688base 9; each digit is two ternary digits: 7 digits
Duodecimal56bbbbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8dd5bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:25:55:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0TTT1T1000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010111011100000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010011001011111111
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes315 32 ff
Gray code111111010101110000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010011001011111111
64-bit0000000000000000000000000000000000000000000101010011001011111111
One's complement11111111111010101100110100000000at 32 bits, every bit flipped
Bits reversed11111111010011001010100000000000at 32 bits
Rotated left by 100000000001010100110010111111110at 32 bits, wrapping
Shifted left by 11010100110010111111110= 2,778,622, no wrap
Shifted right by 110101001100101111111= 694,655, discarding the low bit
These bits as a double6.86410836 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,389,311 to the power 21,930,185,054,721
1,389,311 to the power 32,681,627,328,559,487,231
1,389,311 to the power 43,725,614,345,468,309,764,387,841
1,389,311 to the power 55,176,036,991,916,922,907,071,435,767,551
First ten multiples1,389,311, 2,778,622, 4,167,933, 5,557,244, 6,946,555, 8,335,866, 9,725,177, 11,114,488, 12,503,799, 13,893,110
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1111the total stopping time
Highest value reached90,129,07664× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,389,311 → 4,167,934 → 2,083,967 → 6,251,902 → 3,125,951 → 9,377,854 → 4,688,927 → 14,066,782 → 7,033,391 → 21,100,174 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage138,931,100%
1,389,311% as a decimal13,893.11
1,389,311% of 1001,389,311
1,389,311% of 1,00013,893,110
As a fraction of 1001,389,311/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,389,311
Nerdulate something else
Nothing in mind? Surprise me · today’s page