Number
2,259,009
- Positive
- Odd
- Composite
- Perfect square
- 7 digits
2,259,009 is an odd 7-digit integer and a composite number. It has 15 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,259,009
Digit count7
Digit sum27
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 1,503²
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 167^2
Distinct prime factors23, 167
Number of divisors15
Sum of divisors σ(n)3,394,897
Aliquot sum1,135,888sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,496,988integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 81, 167, 501, 1,503, 4,509, 13,527, 27,889, 83,667, 251,001, 753,003, 2,259,00915 in total
Arithmetic
Previous number2,259,008
Next number2,259,010
Double4,518,018
Half1,129,504.5
Square5,103,121,662,081
Cube11,527,997,762,735,937,729
Square root1,503exact
Cube root131.211727616≈
Negation-2,259,009
Reciprocal4.42671986 × 10^-7≈
Representations
Decimal2,259,009
Binary100010011110000100000122 bits
Octal10474101
Hexadecimal227841
Base 361CF29
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and fifty-nine thousand and nine
Ordinaltwo million, two hundred and fifty-nine thousand and ninth
Scientific notation2.259009 × 10^6
Engineering notation2.259009 × 10^6
Nearest landmarks
Powers & multiples
2,259,009 to the power 25,103,121,662,081
2,259,009 to the power 311,527,997,762,735,937,729
2,259,009 to the power 426,041,850,698,000,347,953,250,561
2,259,009 to the power 558,828,775,103,439,068,029,524,596,554,049
First ten multiples2,259,009, 4,518,018, 6,777,027, 9,036,036, 11,295,045, 13,554,054, 15,813,063, 18,072,072, 20,331,081, 22,590,090
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
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 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1161the total stopping time
Highest value reached6,777,0283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,259,009 → 6,777,028 → 3,388,514 → 1,694,257 → 5,082,772 → 2,541,386 → 1,270,693 → 3,812,080 → 1,906,040 → 953,020 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage225,900,900%
2,259,009% as a decimal22,590.09
2,259,009% of 1002,259,009
2,259,009% of 1,00022,590,090
As a fraction of 1002,259,009/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,259,009
Nerdulate something else
Nothing in mind? Surprise me · today’s page