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
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
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
Nearest landmarks
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
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,138,489
Nerdulate something else
Nothing in mind? Surprise me · today’s page