Recognised as Number
2,246,999
- Positive
- Odd
- Prime
- 7 digits
2,246,999 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,246,999
Digit count7
Digit sum41
Digit product69,984
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,246,999
Distinct prime factors12,246,999
Number of divisors2
Sum of divisors σ(n)2,247,000
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,246,998integers below n that share no factor with it
Carmichael function λ(n)2,246,998the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2,246,9992 in total
Arithmetic
Previous number2,246,998
Next number2,247,000
Double4,493,998
Half1,123,499.5
Square5,049,004,506,001
Cube11,345,108,075,979,740,999
Square root1,498.999332888≈irrational, shown to 9 decimal places
Cube root130.97878568≈
Negation-2,246,999
Reciprocal4.45038026 × 10^-7≈
Representations
Decimal2,246,999
Binary100010010010010101011122 bits
Octal10444527
Hexadecimal224957
Base 361C5SN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and forty-six thousand, nine hundred and ninety-nine
Ordinaltwo million, two hundred and forty-six thousand, nine hundred and ninety-ninth
Scientific notation2.246999 × 10^6
Engineering notation2.246999 × 10^6
In other bases
Ternary11020011022012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1033400444base 5; one hand: 10 digits
Septenary25046006base 7: 8 digits
Nonary4204265base 9; each digit is two ternary digits: 7 digits
Duodecimal90441bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimale0h9jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:24:9:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T001110T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100101111010101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000100100100101010111
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; 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 57
Gray code1100110110110111111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000100100100101010111
64-bit0000000000000000000000000000000000000000001000100100100101010111
One's complement11111111110111011011011010101000at 32 bits, every bit flipped
Bits reversed11101010100100100100010000000000at 32 bits
Rotated left by 100000000010001001001001010101110at 32 bits, wrapping
Shifted left by 110001001001001010101110= 4,493,998, no wrap
Shifted right by 1100010010010010101011= 1,123,499, discarding the low bit
These bits as a double1.11016501 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,246,999 to the power 25,049,004,506,001
2,246,999 to the power 311,345,108,075,979,740,999
2,246,999 to the power 425,492,446,501,618,402,045,012,001
2,246,999 to the power 557,281,501,796,690,047,776,739,921,234,999
First ten multiples2,246,999, 4,493,998, 6,740,997, 8,987,996, 11,234,995, 13,481,994, 15,728,993, 17,975,992, 20,222,991, 22,469,990
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 99
Collatz (3n + 1) trajectory
Steps to reach 1179the total stopping time
Highest value reached15,167,2486× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,246,999 → 6,740,998 → 3,370,499 → 10,111,498 → 5,055,749 → 15,167,248 → 7,583,624 → 3,791,812 → 1,895,906 → 947,953 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage224,699,900%
2,246,999% as a decimal22,469.99
2,246,999% of 1002,246,999
2,246,999% of 1,00022,469,990
As a fraction of 1002,246,999/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,246,999
Nerdulate something else
Nothing in mind? Surprise me · today’s page