Recognised as Number
2,431,223
- Positive
- Odd
- Prime
- 7 digits
2,431,223 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,431,223
Digit count7
Digit sum17
Digit product288
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,431,223
Distinct prime factors12,431,223
Number of divisors2
Sum of divisors σ(n)2,431,224
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,431,222integers below n that share no factor with it
Carmichael function λ(n)2,431,222the 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,431,2232 in total
Arithmetic
Previous number2,431,222
Next number2,431,224
Double4,862,446
Half1,215,611.5
Square5,910,845,275,729
Cube14,370,582,983,793,686,567
Square root1,559.2379549≈irrational, shown to 9 decimal places
Cube root134.464693174≈
Negation-2,431,223
Reciprocal4.11315622 × 10^-7≈
Representations
Decimal2,431,223
Binary100101000110001111011122 bits
Octal11214367
Hexadecimal2518F7
Base 361G3XZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and thirty-one thousand, two hundred and twenty-three
Ordinaltwo million, four hundred and thirty-one thousand, two hundred and twenty-third
Scientific notation2.431223 × 10^6
Engineering notation2.431223 × 10^6
In other bases
Ternary11120112000022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1110244343base 5; one hand: 10 digits
Septenary26444054base 7: 8 digits
Nonary4515008base 9; each digit is two ternary digits: 7 digits
Duodecimal992b5bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf3i13base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:15:20:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT1TTT00010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001010110100100001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001010001100011110111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes325 18 f7
Gray code1101111001010010001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001010001100011110111
64-bit0000000000000000000000000000000000000000001001010001100011110111
One's complement11111111110110101110011100001000at 32 bits, every bit flipped
Bits reversed11101111000110001010010000000000at 32 bits
Rotated left by 100000000010010100011000111101110at 32 bits, wrapping
Shifted left by 110010100011000111101110= 4,862,446, no wrap
Shifted right by 1100101000110001111011= 1,215,611, discarding the low bit
These bits as a double1.20118376 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,431,223 to the power 25,910,845,275,729
2,431,223 to the power 314,370,582,983,793,686,567
2,431,223 to the power 434,938,091,873,607,838,036,481,441
2,431,223 to the power 584,942,292,539,228,468,814,568,518,432,343
First ten multiples2,431,223, 4,862,446, 7,293,669, 9,724,892, 12,156,115, 14,587,338, 17,018,561, 19,449,784, 21,881,007, 24,312,230
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 23
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Highest value reached16,410,7606× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,431,223 → 7,293,670 → 3,646,835 → 10,940,506 → 5,470,253 → 16,410,760 → 8,205,380 → 4,102,690 → 2,051,345 → 6,154,036 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage243,122,300%
2,431,223% as a decimal24,312.23
2,431,223% of 1002,431,223
2,431,223% of 1,00024,312,230
As a fraction of 1002,431,223/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,431,223
Nerdulate something else
Nothing in mind? Surprise me · today’s page