Recognised as Number
1,431,926
- Positive
- Even
- Composite
- 7 digits
1,431,926 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,431,926
Digit count7
Digit sum26
Digit product1,296
Multiplicative persistence3times 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 × 715,963
Distinct prime factors22, 715,963
Number of divisors4
Sum of divisors σ(n)2,147,892
Aliquot sum715,966sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)715,962integers below n that share no factor with it
Carmichael function λ(n)715,962the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 715,963, 1,431,9264 in total
Arithmetic
Previous number1,431,925
Next number1,431,927
Double2,863,852
Half715,963
Square2,050,412,069,476
Cube2,936,038,352,996,490,776
Square root1,196.631104393≈irrational, shown to 9 decimal places
Cube root112.712874308≈
Negation-1,431,926
Reciprocal6.98360111 × 10^-7≈
Representations
Decimal1,431,926
Binary10101110110010111011021 bits
Octal5354566
Hexadecimal15D976
Base 36UOVQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and thirty-one thousand, nine hundred and twenty-six
Ordinalone million, four hundred and thirty-one thousand, nine hundred and twenty-sixth
Scientific notation1.431926 × 10^6
Engineering notation1.431926 × 10^6
In other bases
Ternary2200202020022base 3; the most digit-efficient integer base after e: 13 digits
Quinary331310201base 5; one hand: 9 digits
Septenary15112466base 7: 8 digits
Nonary2622208base 9; each digit is two ternary digits: 7 digits
Duodecimal5907b2base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8ijg6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:37:45:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T01T1T1T010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100010111010001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101011101100101110110
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes315 d9 76
Gray code111110011010111001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101011101100101110110
64-bit0000000000000000000000000000000000000000000101011101100101110110
One's complement11111111111010100010011010001001at 32 bits, every bit flipped
Bits reversed01101110100110111010100000000000at 32 bits
Rotated left by 100000000001010111011001011101100at 32 bits, wrapping
Shifted left by 11010111011001011101100= 2,863,852, no wrap
Shifted right by 110101110110010111011= 715,963, discarding the low bit
These bits as a double7.07465444 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,431,926 to the power 22,050,412,069,476
1,431,926 to the power 32,936,038,352,996,490,776
1,431,926 to the power 44,204,189,654,652,853,050,914,576
1,431,926 to the power 56,020,088,475,428,441,257,783,905,153,376
First ten multiples1,431,926, 2,863,852, 4,295,778, 5,727,704, 7,159,630, 8,591,556, 10,023,482, 11,455,408, 12,887,334, 14,319,260
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 1
Divisible by 12No, remainder 2
Divisible by 100No, remainder 26
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached13,949,8729× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,431,926 → 715,963 → 2,147,890 → 1,073,945 → 3,221,836 → 1,610,918 → 805,459 → 2,416,378 → 1,208,189 → 3,624,568 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage143,192,600%
1,431,926% as a decimal14,319.26
1,431,926% of 1001,431,926
1,431,926% of 1,00014,319,260
As a fraction of 1001,431,926/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 1,431,926
Nerdulate something else
Nothing in mind? Surprise me · today’s page