Nerdulator> put something in

Recognised as Number

1,396,089

  • Positive
  • Odd
  • Composite
  • 7 digits

1,396,089 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,396,089
Digit count7
Digit sum36
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^3 × 29 × 1,783
Distinct prime factors33, 29, 1,783
Number of divisors16
Sum of divisors σ(n)2,140,800
Aliquot sum744,711sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)898,128integers below n that share no factor with it
Carmichael function λ(n)24,948the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 898,128
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 29, 87, 261, 783, 1,783, 5,349, 16,047, 48,141, 51,707, 155,121, 465,363, 1,396,08916 in total

Arithmetic

Previous number1,396,088
Next number1,396,090
Double2,792,178
Cube2,721,067,503,045,852,969
Square root1,181.562101626≈irrational, shown to 9 decimal places
Cube root111.764625805≈
Negation-1,396,089
Reciprocal7.16286712 × 10^-7≈

Representations

Decimal1,396,089
Binary10101010011010111100121 bits
Octal5246571
Hexadecimal154D79
Base 36TX89
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and ninety-six thousand and eighty-nine
Ordinalone million, three hundred and ninety-six thousand and eighty-ninth
Scientific notation1.396089 × 10^6
Engineering notation1.396089 × 10^6

In other bases

Ternary2121221002000base 3; the most digit-efficient integer base after e: 13 digits
Quinary324133324base 5; one hand: 9 digits
Septenary14603142base 7: 8 digits
Nonary2557060base 9; each digit is two ternary digits: 7 digits
Duodecimal573b09base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8ea49base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:27:48:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T0T101T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010101001010001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101010100110101111001
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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 4d 79
Gray code111111110101111000101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101010100110101111001
64-bit0000000000000000000000000000000000000000000101010100110101111001
One's complement11111111111010101011001010000110at 32 bits, every bit flipped
Bits reversed10011110101100101010100000000000at 32 bits
Rotated left by 100000000001010101001101011110010at 32 bits, wrapping
Shifted left by 11010101001101011110010= 2,792,178, no wrap
Shifted right by 110101010011010111100= 698,044, discarding the low bit
These bits as a double6.89759613 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,396,093+4
Previous prime1,396,069−20
Distance to nearest prime4
Nearest square below1,394,761
Nearest square above1,397,124

Powers & multiples

1,396,089 to the power 21,949,064,495,921
1,396,089 to the power 32,721,067,503,045,852,969
1,396,089 to the power 43,798,852,409,259,781,825,638,241
1,396,089 to the power 55,303,536,061,191,079,549,173,466,239,449
First ten multiples1,396,089, 2,792,178, 4,188,267, 5,584,356, 6,980,445, 8,376,534, 9,772,623, 11,168,712, 12,564,801, 13,960,890
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

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 2
Divisible by 8No, remainder 1
Divisible by 9Yes
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 1181the total stopping time
Highest value reached17,890,14412× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,396,089 → 4,188,268 → 2,094,134 → 1,047,067 → 3,141,202 → 1,570,601 → 4,711,804 → 2,355,902 → 1,177,951 → 3,533,854 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage139,608,900%
1,396,089% as a decimal13,960.89
1,396,089% of 1001,396,089
1,396,089% of 1,00013,960,890
As a fraction of 1001,396,089/100

Read another way

As bytes1.331 MiB
As a 24-bit colour#154D79

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1396089” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.