Number
1,138,491
- Positive
- Odd
- Composite
- 7 digits
1,138,491 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,138,491
Digit count7
Digit sum27
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 126,499
Distinct prime factors23, 126,499
Number of divisors6
Sum of divisors σ(n)1,644,500
Aliquot sum506,009sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)758,988integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 126,499, 379,497, 1,138,4916 in total
Arithmetic
Previous number1,138,490
Next number1,138,492
Double2,276,982
Half569,245.5
Square1,296,161,757,081
Cube1,475,668,494,980,904,771
Square root1,067.000937207≈irrational, shown to 9 decimal places
Cube root104.418279708≈
Negation-1,138,491
Reciprocal8.78355648 × 10^-7≈
Representations
Decimal1,138,491
Binary10001010111110011101121 bits
Octal4257473
Hexadecimal115F3B
Base 36OEGR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-eight thousand, four hundred and ninety-one
Ordinalone million, one hundred and thirty-eight thousand, four hundred and ninety-first
Scientific notation1.138491 × 10^6
Engineering notation1.138491 × 10^6
Nearest landmarks
Powers & multiples
1,138,491 to the power 21,296,161,757,081
1,138,491 to the power 31,475,668,494,980,904,771
1,138,491 to the power 41,680,035,300,519,305,253,640,561
1,138,491 to the power 51,912,705,069,323,524,357,522,495,933,451
First ten multiples1,138,491, 2,276,982, 3,415,473, 4,553,964, 5,692,455, 6,830,946, 7,969,437, 9,107,928, 10,246,419, 11,384,910
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1160the total stopping time
Highest value reached5,763,6165× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,138,491 → 3,415,474 → 1,707,737 → 5,123,212 → 2,561,606 → 1,280,803 → 3,842,410 → 1,921,205 → 5,763,616 → 2,881,808 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,849,100%
1,138,491% as a decimal11,384.91
1,138,491% of 1001,138,491
1,138,491% of 1,00011,384,910
As a fraction of 1001,138,491/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,491
Nerdulate something else
Nothing in mind? Surprise me · today’s page