Number
2,253,001
- Positive
- Odd
- Composite
- Perfect square
- 7 digits
2,253,001 is an odd 7-digit integer and a composite number. It has 9 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,253,001
Digit count7
Digit sum13
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 1,501²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation19^2 × 79^2
Distinct prime factors219, 79
Number of divisors9
Sum of divisors σ(n)2,408,301
Aliquot sum155,300sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,107,404integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 19, 79, 361, 1,501, 6,241, 28,519, 118,579, 2,253,0019 in total
Arithmetic
Previous number2,253,000
Next number2,253,002
Double4,506,002
Half1,126,500.5
Square5,076,013,506,001
Cube11,436,263,505,033,759,001
Square root1,501exact
Cube root131.095301939≈
Negation-2,253,001
Reciprocal4.43852444 × 10^-7≈
Representations
Decimal2,253,001
Binary100010011000001100100122 bits
Octal10460311
Hexadecimal2260C9
Base 361CAFD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and fifty-three thousand and one
Ordinaltwo million, two hundred and fifty-three thousand and first
Scientific notation2.253001 × 10^6
Engineering notation2.253001 × 10^6
Nearest landmarks
Powers & multiples
2,253,001 to the power 25,076,013,506,001
2,253,001 to the power 311,436,263,505,033,759,001
2,253,001 to the power 425,765,913,113,104,564,063,012,001
2,253,001 to the power 558,050,628,009,737,695,938,530,101,265,001
First ten multiples2,253,001, 4,506,002, 6,759,003, 9,012,004, 11,265,005, 13,518,006, 15,771,007, 18,024,008, 20,277,009, 22,530,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 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1148the total stopping time
Highest value reached11,405,8245× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,253,001 → 6,759,004 → 3,379,502 → 1,689,751 → 5,069,254 → 2,534,627 → 7,603,882 → 3,801,941 → 11,405,824 → 5,702,912 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage225,300,100%
2,253,001% as a decimal22,530.01
2,253,001% of 1002,253,001
2,253,001% of 1,00022,530,010
As a fraction of 1002,253,001/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,253,001
Nerdulate something else
Nothing in mind? Surprise me · today’s page