Recognised as Number
2,431,231
- Positive
- Odd
- Composite
- 7 digits
2,431,231 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,431,231
Digit count7
Digit sum16
Digit product144
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 221,021
Distinct prime factors211, 221,021
Number of divisors4
Sum of divisors σ(n)2,652,264
Aliquot sum221,033sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,210,200integers below n that share no factor with it
Carmichael function λ(n)221,020the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,210,200
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 221,021, 2,431,2314 in total
Arithmetic
Previous number2,431,230
Next number2,431,232
Double4,862,462
Half1,215,615.5
Square5,910,884,175,361
Cube14,370,724,844,547,099,391
Square root1,559.240520253≈irrational, shown to 9 decimal places
Cube root134.46484066≈
Negation-2,431,231
Reciprocal4.11314268 × 10^-7≈
Representations
Decimal2,431,231
Binary100101000110001111111122 bits
Octal11214377
Hexadecimal2518FF
Base 361G3Y7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and thirty-one thousand, two hundred and thirty-one
Ordinaltwo million, four hundred and thirty-one thousand, two hundred and thirty-first
Scientific notation2.431231 × 10^6
Engineering notation2.431231 × 10^6
In other bases
Ternary11120112000121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1110244411base 5; one hand: 10 digits
Septenary26444065base 7: 8 digits
Nonary4515017base 9; each digit is two ternary digits: 7 digits
Duodecimal992b67base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf3i1bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:15:20:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT1TTT001TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001010110100100000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001010001100011111111
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes325 18 ff
Gray code1101111001010010000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001010001100011111111
64-bit0000000000000000000000000000000000000000001001010001100011111111
One's complement11111111110110101110011100000000at 32 bits, every bit flipped
Bits reversed11111111000110001010010000000000at 32 bits
Rotated left by 100000000010010100011000111111110at 32 bits, wrapping
Shifted left by 110010100011000111111110= 4,862,462, no wrap
Shifted right by 1100101000110001111111= 1,215,615, discarding the low bit
These bits as a double1.20118771 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,431,231 to the power 25,910,884,175,361
2,431,231 to the power 314,370,724,844,547,099,391
2,431,231 to the power 434,938,551,734,533,088,999,480,321
2,431,231 to the power 584,943,690,072,100,616,501,295,540,305,151
First ten multiples2,431,231, 4,862,462, 7,293,693, 9,724,924, 12,156,155, 14,587,386, 17,018,617, 19,449,848, 21,881,079, 24,312,310
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1197the total stopping time
Highest value reached124,619,63251× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,431,231 → 7,293,694 → 3,646,847 → 10,940,542 → 5,470,271 → 16,410,814 → 8,205,407 → 24,616,222 → 12,308,111 → 36,924,334 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage243,123,100%
2,431,231% as a decimal24,312.31
2,431,231% of 1002,431,231
2,431,231% of 1,00024,312,310
As a fraction of 1002,431,231/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,231
Nerdulate something else
Nothing in mind? Surprise me · today’s page