Number
2,167,601
- Positive
- Odd
- Composite
- 7 digits
2,167,601 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,167,601
Digit count7
Digit sum23
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation59 × 36,739
Distinct prime factors259, 36,739
Number of divisors4
Sum of divisors σ(n)2,204,400
Aliquot sum36,799sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,130,804integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 59, 36,739, 2,167,6014 in total
Arithmetic
Previous number2,167,600
Next number2,167,602
Double4,335,202
Half1,083,800.5
Square4,698,494,095,201
Cube10,184,460,499,251,782,801
Square root1,472.277487432≈irrational, shown to 9 decimal places
Cube root129.417532205≈
Negation-2,167,601
Reciprocal4.61339518 × 10^-7≈
Representations
Decimal2,167,601
Binary100001000100110011000122 bits
Octal10211461
Hexadecimal211331
Base 361AGJ5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and sixty-seven thousand, six hundred and one
Ordinaltwo million, one hundred and sixty-seven thousand, six hundred and first
Scientific notation2.167601 × 10^6
Engineering notation2.167601 × 10^6
Nearest landmarks
Powers & multiples
2,167,601 to the power 24,698,494,095,201
2,167,601 to the power 310,184,460,499,251,782,801
2,167,601 to the power 422,075,846,762,638,663,651,230,401
2,167,601 to the power 547,851,627,518,542,329,969,070,668,438,001
First ten multiples2,167,601, 4,335,202, 6,502,803, 8,670,404, 10,838,005, 13,005,606, 15,173,207, 17,340,808, 19,508,409, 21,676,010
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 147the total stopping time
Highest value reached6,502,8043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,167,601 → 6,502,804 → 3,251,402 → 1,625,701 → 4,877,104 → 2,438,552 → 1,219,276 → 609,638 → 304,819 → 914,458 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage216,760,100%
2,167,601% as a decimal21,676.01
2,167,601% of 1002,167,601
2,167,601% of 1,00021,676,010
As a fraction of 1002,167,601/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 2,167,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page