Recognised as Number
1,237,137
- Positive
- Odd
- Composite
- 7 digits
1,237,137 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,237,137
Digit count7
Digit sum24
Digit product882
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 11 × 37,489
Distinct prime factors33, 11, 37,489
Number of divisors8
Sum of divisors σ(n)1,799,520
Aliquot sum562,383sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)749,760integers below n that share no factor with it
Carmichael function λ(n)187,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 749,760
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 37,489, 112,467, 412,379, 1,237,1378 in total
Arithmetic
Previous number1,237,136
Next number1,237,138
Double2,474,274
Half618,568.5
Square1,530,507,956,769
Cube1,893,448,022,113,330,353
Square root1,112.266604731≈irrational, shown to 9 decimal places
Cube root107.35095986≈
Negation-1,237,137
Reciprocal8.08317915 × 10^-7≈
Representations
Decimal1,237,137
Binary10010111000001001000121 bits
Octal4560221
Hexadecimal12E091
Base 36QIKX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and thirty-seven thousand, one hundred and thirty-seven
Ordinalone million, two hundred and thirty-seven thousand, one hundred and thirty-seventh
Scientific notation1.237137 × 10^6
Engineering notation1.237137 × 10^6
In other bases
Ternary2022212000220base 3; the most digit-efficient integer base after e: 13 digits
Quinary304042022base 5; one hand: 9 digits
Septenary13341546base 7: 8 digits
Nonary2285026base 9; each digit is two ternary digits: 7 digits
Duodecimal4b7b29base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7ecghbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:43:38:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1000TT0010T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110010000110010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100101110000010010001
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 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 91
Gray code110111001000011011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100101110000010010001
64-bit0000000000000000000000000000000000000000000100101110000010010001
One's complement11111111111011010001111101101110at 32 bits, every bit flipped
Bits reversed10001001000001110100100000000000at 32 bits
Rotated left by 100000000001001011100000100100010at 32 bits, wrapping
Shifted left by 11001011100000100100010= 2,474,274, no wrap
Shifted right by 110010111000001001000= 618,568, discarding the low bit
These bits as a double6.11226891 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,237,137 to the power 21,530,507,956,769
1,237,137 to the power 31,893,448,022,113,330,353
1,237,137 to the power 42,342,454,605,733,219,172,919,361
1,237,137 to the power 52,897,937,263,572,977,567,927,939,509,457
First ten multiples1,237,137, 2,474,274, 3,711,411, 4,948,548, 6,185,685, 7,422,822, 8,659,959, 9,897,096, 11,134,233, 12,371,370
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1235the total stopping time
Highest value reached3,963,3283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,237,137 → 3,711,412 → 1,855,706 → 927,853 → 2,783,560 → 1,391,780 → 695,890 → 347,945 → 1,043,836 → 521,918 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage123,713,700%
1,237,137% as a decimal12,371.37
1,237,137% of 1001,237,137
1,237,137% of 1,00012,371,370
As a fraction of 1001,237,137/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,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page