Recognised as Number
2,247,001
- Positive
- Odd
- Composite
- Perfect square
- 7 digits
2,247,001 is an odd 7-digit integer and a composite number. It has 3 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,247,001
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 1,499²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,499^2
Distinct prime factors11,499
Number of divisors3
Sum of divisors σ(n)2,248,501
Aliquot sum1,500sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,245,502integers below n that share no factor with it
Carmichael function λ(n)2,245,502the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 1,499, 2,247,0013 in total
Arithmetic
Previous number2,247,000
Next number2,247,002
Double4,494,002
Half1,123,500.5
Square5,049,013,494,001
Cube11,345,138,370,033,741,001
Square root1,499exact
Cube root130.97882454≈
Negation-2,247,001
Reciprocal4.4503763 × 10^-7≈
Representations
Decimal2,247,001
Binary100010010010010101100122 bits
Octal10444531
Hexadecimal224959
Base 361C5SP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and forty-seven thousand and one
Ordinaltwo million, two hundred and forty-seven thousand and first
Scientific notation2.247001 × 10^6
Engineering notation2.247001 × 10^6
In other bases
Ternary11020011022021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1033401001base 5; one hand: 10 digits
Septenary25046011base 7: 8 digits
Nonary4204267base 9; each digit is two ternary digits: 7 digits
Duodecimal904421base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimale0ha1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:24:10:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T001110T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100101111010101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000100100100101011001
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes322 49 59
Gray code1100110110110111110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000100100100101011001
64-bit0000000000000000000000000000000000000000001000100100100101011001
One's complement11111111110111011011011010100110at 32 bits, every bit flipped
Bits reversed10011010100100100100010000000000at 32 bits
Rotated left by 100000000010001001001001010110010at 32 bits, wrapping
Shifted left by 110001001001001010110010= 4,494,002, no wrap
Shifted right by 1100010010010010101100= 1,123,500, discarding the low bit
These bits as a double1.110166 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,247,001 to the power 25,049,013,494,001
2,247,001 to the power 311,345,138,370,033,741,001
2,247,001 to the power 425,492,537,262,604,186,062,988,001
2,247,001 to the power 557,281,756,721,608,868,687,720,101,235,001
First ten multiples2,247,001, 4,494,002, 6,741,003, 8,988,004, 11,235,005, 13,482,006, 15,729,007, 17,976,008, 20,223,009, 22,470,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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1210the total stopping time
Highest value reached7,583,6323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,247,001 → 6,741,004 → 3,370,502 → 1,685,251 → 5,055,754 → 2,527,877 → 7,583,632 → 3,791,816 → 1,895,908 → 947,954 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage224,700,100%
2,247,001% as a decimal22,470.01
2,247,001% of 1002,247,001
2,247,001% of 1,00022,470,010
As a fraction of 1002,247,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,247,001
Nerdulate something else
Nothing in mind? Surprise me · today’s page