Recognised as Number

1,138,489

Positive
Odd
Composite
Perfect square
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,138,489

Digit count7

Digit sum34

Digit product6,912

Multiplicative persistence3times the digit product can be taken before one digit is left

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Perfect squareYes, 1,067²

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11^2 × 97^2

Distinct prime factors211, 97

Number of divisors9

Sum of divisors σ(n)1,264,431

Aliquot sum125,942sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,024,320integers below n that share no factor with it

Carmichael function λ(n)512,160the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,024,320

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 11, 97, 121, 1,067, 9,409, 11,737, 103,499, 1,138,4899 in total

Arithmetic

Previous number1,138,488

Next number1,138,490

Double2,276,978

Half569,244.5

Square1,296,157,203,121

Cube1,475,660,718,024,024,169

Square root1,067exact

Cube root104.418218563≈

Negation-1,138,489

Reciprocal8.78357191 × 10^-7≈

Representations

Decimal1,138,489

Binary10001010111110011100121 bits

Octal4257471

Hexadecimal115F39

Base 36OEGP

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, one hundred and thirty-eight thousand, four hundred and eighty-nine

Ordinalone million, one hundred and thirty-eight thousand, four hundred and eighty-ninth

Scientific notation1.138489 × 10^6

Engineering notation1.138489 × 10^6

In other bases

Ternary2010211201021base 3; the most digit-efficient integer base after e: 13 digits

Quinary242412424base 5; one hand: 9 digits

Septenary12451132base 7: 8 digits

Nonary2124637base 9; each digit is two ternary digits: 7 digits

Duodecimal46aa21base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal72649base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:16:14:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T0110TTT011T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary101101010001101001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100010101111100111001

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

Bytes311 5f 39

Gray code110011111000010100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100010101111100111001

64-bit0000000000000000000000000000000000000000000100010101111100111001

One's complement11111111111011101010000011000110at 32 bits, every bit flipped

Bits reversed10011100111110101000100000000000at 32 bits

Rotated left by 100000000001000101011111001110010at 32 bits, wrapping

Shifted left by 11000101011111001110010= 2,276,978, no wrap

Shifted right by 110001010111110011100= 569,244, discarding the low bit

These bits as a double5.62488303 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,138,519+30

Previous prime1,138,483−6

Distance to nearest prime6

Nearest square below1,138,489

Nearest square above1,140,624

Powers & multiples

1,138,489 to the power 21,296,157,203,121

1,138,489 to the power 31,475,660,718,024,024,169

1,138,489 to the power 41,680,023,495,202,453,252,140,641

1,138,489 to the power 51,912,688,269,029,545,800,576,346,231,449

First ten multiples1,138,489, 2,276,978, 3,415,467, 4,553,956, 5,692,445, 6,830,934, 7,969,423, 9,107,912, 10,246,401, 11,384,890

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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 1

Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 1160the total stopping time

Highest value reached3,842,4043× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,138,489 → 3,415,468 → 1,707,734 → 853,867 → 2,561,602 → 1,280,801 → 3,842,404 → 1,921,202 → 960,601 → 2,881,804 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage113,848,900%

1,138,489% as a decimal11,384.89

1,138,489% of 1001,138,489

1,138,489% of 1,00011,384,890

As a fraction of 1001,138,489/100

Read another way

As seconds13 days, 4 hours and 14 minutes

As bytes1.086 MiB

As a 24-bit colour#115F39

Keep nerding

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