Recognised as Number
1,237,143
- Positive
- Odd
- Composite
- 7 digits
1,237,143 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,237,143
Digit count7
Digit sum21
Digit product504
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 151 × 2,731
Distinct prime factors33, 151, 2,731
Number of divisors8
Sum of divisors σ(n)1,661,056
Aliquot sum423,913sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)819,000integers below n that share no factor with it
Carmichael function λ(n)13,650the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 819,000
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 151, 453, 2,731, 8,193, 412,381, 1,237,1438 in total
Arithmetic
Previous number1,237,142
Next number1,237,144
Double2,474,286
Half618,571.5
Square1,530,522,802,449
Cube1,893,475,571,390,163,207
Square root1,112.269301923≈irrational, shown to 9 decimal places
Cube root107.351133407≈
Negation-1,237,143
Reciprocal8.08313994 × 10^-7≈
Representations
Decimal1,237,143
Binary10010111000001001011121 bits
Octal4560227
Hexadecimal12E097
Base 36QIL3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and thirty-seven thousand, one hundred and forty-three
Ordinalone million, two hundred and thirty-seven thousand, one hundred and forty-third
Scientific notation1.237143 × 10^6
Engineering notation1.237143 × 10^6
In other bases
Ternary2022212001010base 3; the most digit-efficient integer base after e: 13 digits
Quinary304042033base 5; one hand: 9 digits
Septenary13341555base 7: 8 digits
Nonary2285033base 9; each digit is two ternary digits: 7 digits
Duodecimal4b7b33base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7ech3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:43:39:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1000TT001010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110010000111101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100101110000010010111
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes312 e0 97
Gray code110111001000011011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100101110000010010111
64-bit0000000000000000000000000000000000000000000100101110000010010111
One's complement11111111111011010001111101101000at 32 bits, every bit flipped
Bits reversed11101001000001110100100000000000at 32 bits
Rotated left by 100000000001001011100000100101110at 32 bits, wrapping
Shifted left by 11001011100000100101110= 2,474,286, no wrap
Shifted right by 110010111000001001011= 618,571, discarding the low bit
These bits as a double6.11229855 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,237,143 to the power 21,530,522,802,449
1,237,143 to the power 31,893,475,571,390,163,207
1,237,143 to the power 42,342,500,048,816,340,680,397,601
1,237,143 to the power 52,898,007,537,892,794,158,369,129,293,943
First ten multiples1,237,143, 2,474,286, 3,711,429, 4,948,572, 6,185,715, 7,422,858, 8,660,001, 9,897,144, 11,134,287, 12,371,430
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1142the total stopping time
Highest value reached8,350,7206× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,237,143 → 3,711,430 → 1,855,715 → 5,567,146 → 2,783,573 → 8,350,720 → 4,175,360 → 2,087,680 → 1,043,840 → 521,920 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage123,714,300%
1,237,143% as a decimal12,371.43
1,237,143% of 1001,237,143
1,237,143% of 1,00012,371,430
As a fraction of 1001,237,143/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,237,143
Nerdulate something else
Nothing in mind? Surprise me · today’s page