Number
1,361,889
- Positive
- Odd
- Composite
- Perfect square
- 7 digits
1,361,889 is an odd 7-digit integer and a composite number. It has 9 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,361,889
Digit count7
Digit sum36
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 1,167²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 389^2
Distinct prime factors23, 389
Number of divisors9
Sum of divisors σ(n)1,972,243
Aliquot sum610,354sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)905,592integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 389, 1,167, 3,501, 151,321, 453,963, 1,361,8899 in total
Arithmetic
Previous number1,361,888
Next number1,361,890
Double2,723,778
Half680,944.5
Square1,854,741,648,321
Cube2,525,952,248,690,238,369
Square root1,167exact
Cube root110.844437553≈
Negation-1,361,889
Reciprocal7.34274232 × 10^-7≈
Representations
Decimal1,361,889
Binary10100110001111110000121 bits
Octal5143741
Hexadecimal14C7E1
Base 36T6U9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and sixty-one thousand, eight hundred and eighty-nine
Ordinalone million, three hundred and sixty-one thousand, eight hundred and eighty-ninth
Scientific notation1.361889 × 10^6
Engineering notation1.361889 × 10^6
Nearest landmarks
Powers & multiples
1,361,889 to the power 21,854,741,648,321
1,361,889 to the power 32,525,952,248,690,238,369
1,361,889 to the power 43,440,066,582,016,500,042,119,041
1,361,889 to the power 54,684,988,837,315,869,225,861,458,628,449
First ten multiples1,361,889, 2,723,778, 4,085,667, 5,447,556, 6,809,445, 8,171,334, 9,533,223, 10,895,112, 12,257,001, 13,618,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 4
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1217the total stopping time
Highest value reached24,848,51218× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,361,889 → 4,085,668 → 2,042,834 → 1,021,417 → 3,064,252 → 1,532,126 → 766,063 → 2,298,190 → 1,149,095 → 3,447,286 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage136,188,900%
1,361,889% as a decimal13,618.89
1,361,889% of 1001,361,889
1,361,889% of 1,00013,618,890
As a fraction of 1001,361,889/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,361,889
Nerdulate something else
Nothing in mind? Surprise me · today’s page